default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPaulo A. S. Veloso
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j39]Eduardo N. Giovannini
, Edward Hermann Haeusler, Abel Lassalle-Casanave, Paulo A. S. Veloso:
De Zolt's postulate: an Abstract Approach. Rev. Symb. Log. 15(1): 197-224 (2022)
2010 – 2019
- 2018
- [c36]Sheila R. M. Veloso, Paulo A. S. Veloso, Mario R. F. Benevides, Isaque M. S. Lima:
On Diagrams and General Model Checkers. Diagrams 2018: 680-688 - 2017
- [j38]Paulo A. S. Veloso, Sheila R. M. Veloso, Mario R. F. Benevides:
On a graph calculus for modalities. Theor. Comput. Sci. 685: 83-103 (2017) - 2015
- [c35]Paulo A. S. Veloso, Sheila R. M. Veloso:
On Graphs for Intuitionistic Modal Logics. LSFA 2015: 215-233 - 2014
- [j37]Paulo A. S. Veloso, Sheila R. M. Veloso, Mario R. F. Benevides:
PDL for structured data: a graph-calculus approach. Log. J. IGPL 22(5): 737-757 (2014) - [c34]Paulo A. S. Veloso, Sheila R. M. Veloso, Mario R. F. Benevides:
On Graph Calculi for Multi-modal Logics. LSFA 2014: 231-252 - 2013
- [c33]Paulo A. S. Veloso, Sheila R. M. Veloso, Mario R. F. Benevides:
On a Graph Approach to Modal Logics. LSFA 2013: 123-139 - 2012
- [c32]Paulo A. S. Veloso, Sheila R. M. Veloso:
A Graph Calculus for Predicate Logic. LSFA 2012: 153-168 - 2011
- [c31]Paulo A. S. Veloso, Sheila R. M. Veloso:
On Graph Refutation for Relational Inclusions. LSFA 2011: 47-62 - 2010
- [j36]Paulo A. S. Veloso, Sheila R. M. Veloso, Jorge Petrucio Viana, Renata P. de Freitas, Mario R. F. Benevides, Carla A. D. M. Delgado:
On vague notions and modalities: a modular approach. Log. J. IGPL 18(3): 381-402 (2010) - [j35]Angelo E. M. Ciarlini, Marco A. Casanova, António L. Furtado, Paulo A. S. Veloso:
Modeling interactive storytelling genres as application domains. J. Intell. Inf. Syst. 35(3): 347-381 (2010) - [c30]Renata P. de Freitas, Paulo A. S. Veloso, Sheila R. M. Veloso, Jorge Petrucio Viana:
A Calculus for Graphs with Complement. Diagrams 2010: 84-98 - [c29]Sheila R. M. Veloso, Paulo A. S. Veloso, Paula M. Veloso:
A Tool for Analysing Logics. LSFA 2010: 125-137
2000 – 2009
- 2009
- [j34]Renata P. de Freitas, Paulo A. S. Veloso, Sheila R. M. Veloso, Jorge Petrucio Viana:
On graph reasoning. Inf. Comput. 207(10): 1000-1014 (2009) - [c28]Renata P. de Freitas, Sheila R. M. Veloso, Paulo A. S. Veloso, Jorge Petrucio Viana:
Positive Fork Graph Calculus. LFCS 2009: 152-163 - 2008
- [c27]Paulo A. S. Veloso, Sheila R. M. Veloso:
Methodical Construction of Symbolic Diagrams. SBIA 2008: 187-196 - [c26]Renata P. de Freitas, Paulo A. S. Veloso, Sheila R. M. Veloso, Jorge Petrucio Viana:
On a Graph Calculus for Algebras of Relations. WoLLIC 2008: 298-312 - 2007
- [j33]Renata P. de Freitas, Paulo A. S. Veloso, Sheila R. M. Veloso, Jorge Petrucio Viana:
On Positive Relational Calculi. Log. J. IGPL 15(5-6): 577-601 (2007) - [j32]Leonardo B. Vana, Paulo A. S. Veloso, Sheila R. M. Veloso:
Natural Deduction for "Generally". Log. J. IGPL 15(5-6): 775-800 (2007) - [j31]Paulo A. S. Veloso, Renata P. de Freitas, Jorge Petrucio Viana, Mario R. F. Benevides, Sheila R. M. Veloso:
On Fork Arrow Logic and its Expressive Power. J. Philos. Log. 36(5): 489-509 (2007) - [c25]Leonardo B. Vana, Paulo A. S. Veloso, Sheila R. M. Veloso:
Sequent Calculi for 'Generally'. LSFA 2007: 49-65 - 2006
- [c24]Renata P. de Freitas, Paulo A. S. Veloso, Sheila R. M. Veloso, Jorge Petrucio Viana:
Reasoning with Graphs. WoLLIC 2006: 201-212 - 2005
- [j30]Sheila R. M. Veloso, Paulo A. S. Veloso, Renata P. de Freitas:
An Application of Logic Engineering. Log. J. IGPL 13(1): 29-46 (2005) - [j29]Geiza Maria Hamazaki da Silva, Edward Hermann Haeusler, Paulo A. S. Veloso:
Exploring Computational Contents of Intuitionist Proofs. Log. J. IGPL 13(1): 69-93 (2005) - [j28]Paulo A. S. Veloso, Sheila R. M. Veloso:
On 'Most' and 'Representative': Filter Logic and Special Predicates. Log. J. IGPL 13(6): 717-728 (2005) - 2004
- [j27]Paulo A. S. Veloso, Sheila R. M. Veloso:
Functional Interpretation of Logics for 'Generally'. Log. J. IGPL 12(6): 627-640 (2004) - [j26]Paulo A. S. Veloso, Sheila R. M. Veloso:
On Ultrafilter Logic and Special Functions. Stud Logica 78(3): 459-477 (2004) - [c23]Mario R. F. Benevides, Carla A. D. M. Delgado, Renata P. de Freitas, Paulo A. S. Veloso, Sheila R. M. Veloso:
On Modalities for Vague Notions. SBIA 2004: 1-10 - [p3]Paulo A. S. Veloso, Walter Alexandre Carnielli:
Logics For Qualitative Reasoning. Logic, Epistemology, and the Unity of Science 2004: 487-526 - 2003
- [j25]Renata P. de Freitas, Jorge Petrucio Viana, Mario R. F. Benevides, Sheila R. M. Veloso, Paulo A. S. Veloso:
Squares in Fork Arrow Logic. J. Philos. Log. 32(4): 343-355 (2003) - 2002
- [j24]Paulo A. S. Veloso, José Luiz Fiadeiro, Sheila R. M. Veloso:
On local modularity and interpolation in entailment systems. Inf. Process. Lett. 82(4): 203-211 (2002) - [c22]Sheila R. M. Veloso, Paulo A. S. Veloso:
Qualitative Logic for 'Generally'. IC-AI 2002: 1246-1252 - [c21]Sheila R. M. Veloso, Paulo A. S. Veloso:
On Special Functions and Theorem Proving in Logics for 'Generally'. SBIA 2002: 1-10 - 2001
- [j23]Paulo A. S. Veloso, Sheila R. M. Veloso:
On local modularity variants and -institutions. Inf. Process. Lett. 77(5-6): 247-253 (2001) - 2000
- [c20]Angelo E. M. Ciarlini, Paulo A. S. Veloso, António L. Furtado:
A Formal Framework for Modelling at the Behavioural Level. EJC 2000: 107-122
1990 – 1999
- 1998
- [j22]Sheila R. M. Veloso, Paulo A. S. Veloso, José Luiz Fiadeiro:
Labeled Families in Modular Software Development. J. Braz. Comput. Soc. 5(1) (1998) - 1997
- [j21]Marcelo F. Frias, Armando Martin Haeberer, Paulo A. S. Veloso:
A Finite Axiomatization for Fork Algebras. Log. J. IGPL 5(3): 1-10 (1997) - [j20]Paulo A. S. Veloso, Sheila R. M. Veloso:
On Methods for Safe Introduction of Operations. Inf. Process. Lett. 64(5): 231-238 (1997) - [c19]Walter Alexandre Carnielli, Paulo A. S. Veloso:
Ultrafilter Logic and Generic Reasoning. Kurt Gödel Colloquium 1997: 34-53 - [p2]Armando Martin Haeberer, Marcelo F. Frias, Gabriel Baum, Paulo A. S. Veloso:
Fork Algebras. Relational Methods in Computer Science 1997: 54-69 - 1996
- [j19]Paulo A. S. Veloso:
On Pushout Consistency, Modularity and Interpolation for Logical Specifications. Inf. Process. Lett. 60(2): 59-66 (1996) - 1995
- [j18]Claudia Meré María, Paulo A. S. Veloso:
Definition-like Extensions by Sorts. Log. J. IGPL 3(4): 579-595 (1995) - [j17]Paulo A. S. Veloso, T. S. E. Maibaum:
On the Modularization Theorem for Logical Specifications. Inf. Process. Lett. 53(5): 287-293 (1995) - 1993
- [j16]Paulo A. S. Veloso:
A New, Simpler Proof of the Modularisation Theorem for Logical Specifications. Log. J. IGPL 1(1): 3-12 (1993) - [c18]Rudolf Berghammer, Armando Martin Haeberer, Gunther Schmidt, Paulo A. S. Veloso:
Comparing Two Different Approaches to Products in Abstract Relation Algebra. AMAST 1993: 167-176 - [c17]Haydée Werneck Poubel, Paulo Augusto Silva Veloso:
Sobre o Teorema da Modularização: Importância e uma Prova por Quociente. SBES 1993: 17-29 - 1992
- [j15]Paulo A. S. Veloso:
Yet Antother Cautionary Note on Conservative Extensions: a Simple Case with a Computing Flavour. Bull. EATCS 46: 188-192 (1992) - 1991
- [j14]Paulo A. S. Veloso, Sheila R. M. Veloso:
Some Remarks on Conservative Extensions: A Socratic Dialogue. Bull. EATCS 43: 189-198 (1991) - 1990
- [c16]Laira Vieira Toscani, Paulo A. S. Veloso:
Uma metodologia para cálculo da complexidade de algoritmos. SBES 1990: 183-192
1980 – 1989
- 1989
- [j13]Laira Vieira Toscani, Paulo A. S. Veloso:
A Programação Dinâmica: um caso particular da Divisão e Conquista. RITA 1(2): 53-67 (1989) - [c15]Laira Vieira Toscani, Paulo A. S. Veloso:
Desenvolvimento de Algoritmos Aproximativos por Acercamento: Especificação Formal. SBES 1989: 228-238 - 1988
- [j12]António L. Furtado, Paulo A. S. Veloso:
Iteration for applicative languages. ACM SIGPLAN Notices 23(12): 86-94 (1988) - [c14]Laira Vieira Toscani, Paulo A. S. Veloso:
Programação Dinâmica e Método Guloso. SBES 1988: 106-112 - 1987
- [j11]Paulo A. S. Veloso:
On the concepts of problem and problem-solving method. Decis. Support Syst. 3(2): 133-139 (1987) - 1986
- [p1]Paulo A. S. Veloso, António L. Furtado:
Towards simpler and yet complete formal specificapions. Trends in Information Systems 1986: 257-271 - 1985
- [c13]T. S. E. Maibaum, Paulo A. S. Veloso, M. R. Sadler:
A Theory of Abstract Data Types for Program Development: Bridging the Gap? TAPSOFT, Vol.2 1985: 214-230 - [c12]Paulo A. S. Veloso, António L. Furtado:
Towards Simpler and Yet Complete Formal Specifications. TFAIS 1985: 174-188 - 1984
- [c11]T. S. E. Maibaum, M. R. Sadler, Paulo A. S. Veloso:
Logical Specification and Implementation. FSTTCS 1984: 13-30 - [c10]Carlos José Pereira de Lucena, R. C. B. Martins, Paulo A. S. Veloso, Donald D. Cowan:
The Data Transform Programming Metho: An Example for File Processing Problems. ICSE 1984: 388-397 - [c9]Marco A. Casanova, Paulo A. S. Veloso, António L. Furtado:
Formal Data Base Specification - An Eclectic Perspective. PODS 1984: 110-118 - 1983
- [j10]Paulo A. S. Veloso, António L. Furtado:
Multi-level specifications based on traces. ACM SIGSOFT Softw. Eng. Notes 8(1): 17-19 (1983) - [c8]Paulo A. S. Veloso:
Problems as Abstract Data Types: Applications to Program Construction. ADT 1983 - [c7]Paulo A. S. Veloso, António L. Furtado:
View Constructs for the Specification and Design of External Schemas. ER 1983: 637-650 - [c6]António L. Furtado, Paulo A. S. Veloso, Marco A. Casanova:
A Grammatical Approach to Data Bases. IFIP Congress 1983: 705-710 - 1982
- [j9]Jean-Luc Rémy, Paulo A. S. Veloso:
Comparing data type specifications via their normal forms. Int. J. Parallel Program. 11(3): 141-153 (1982) - [j8]Paulo A. S. Veloso:
Methodical specification of abstract data types via rewriting systems. Int. J. Parallel Program. 11(5): 295-323 (1982) - [c5]Paulo A. S. Veloso, António L. Furtado:
Stepwise Construction of Algebraic Specifications. Advances in Data Base Theory 1982: 321-352 - [c4]António L. Furtado, Paulo A. S. Veloso:
Specification of data bases through rewriting rules. Graph-Grammars and Their Application to Computer Science 1982: 102-114 - 1981
- [j7]António L. Furtado, Paulo A. S. Veloso:
Procedural specifications and implementations for abstract data types. ACM SIGPLAN Notices 16(3): 53-62 (1981) - [j6]Jean-Luc Rémy, Paulo A. S. Veloso:
An economical method for comparing data type specifications. ACM SIGPLAN Notices 16(5): 39-42 (1981) - [c3]António L. Furtado, Paulo A. S. Veloso, José Mauro Volkmer de Castilho:
Verification and Testing of S-ER Representations. ER 1981: 123-147 - [c2]Paulo A. S. Veloso, José Mauro Volkmer de Castilho, António L. Furtado:
Systematic Derivation of Complementary Specifications. VLDB 1981: 409-421 - 1980
- [j5]Paulo A. S. Veloso:
Characterizations for the regular prefix codes and related families. Int. J. Parallel Program. 9(5): 371-382 (1980)
1970 – 1979
- 1979
- [j4]Paulo A. S. Veloso:
Characterizing the Regular Prefix Codes and Right Power-Bounded Languages. Inf. Process. Lett. 9(1): 5-7 (1979) - [j3]Paulo A. S. Veloso, Arthur Gill:
Some Remarks on Multiple-Entry Finite Automata. J. Comput. Syst. Sci. 18(3): 304-306 (1979) - [j2]Paulo A. S. Veloso:
Traversable stack with fewer errors. ACM SIGPLAN Notices 14(2): 55-59 (1979) - [j1]Paulo A. S. Veloso:
Traversable stack with fewer errors: addenda and corrigenda. ACM SIGPLAN Notices 14(10): 76 (1979) - 1977
- [c1]Paulo A. S. Veloso:
Some Bounds on Quasi-Initialised Finite Automata. International Computing Symposium 1977: 389-393
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
