Mario Roberto Folhadela Benevides

Mario Roberto Folhadela Benevides

Auto-generated profile, based on publicly available information

Mario Roberto Folhadela Benevides

Universidade Federal do Rio de Janeiro

Research Focus & Metrics

Academic Career Length

35Years (1992-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
28 February 2003
Verified
Book Chapter
Closed access
PDF file
PPPaulo F. Pires
Paulo F. Pires
MBMario R.F. Benevides
Mario R.F. Benevides
MMMarta Mattoso
Marta Mattoso

1 February 2000 in Theory of Computing Systems
Verified
Journal Article
Closed access
PDF file
VBValmir Barbosa
Valmir Barbosa
MBM. R. F. Benevides
M. R. F. Benevides
FFF. M. G. França
F. M. G. França

1 April 2011 in Electronic Notes in Theoretical Computer Science
Verified
Journal Article
Open access
MBMario R.F. Benevides
Mario R.F. Benevides
RFRenata de Freitas
Renata de Freitas
PVPetrucio Viana
Petrucio Viana
This work extends Propositional Dynamic Logic (PDL) with parallel composition operator and four atomic programs which formalize the storing and recovering of elements in data structures. A generalization of Kripke semantics is proposed that instead of using set of possible states it uses structured sets of possible states. This new semantics allows for representing data structures and using the five new operator one is capable of reasoning about the manipulation of these data structures. The use of the new language (PRSPDL) is illustrated with some examples. We present sound and complete set of axiom schemata and inference rules to prove all the valid formulas for a restricted fragment called RSPDLo.

1 March 1992 in Journal of Logic and Computation
Verified
Journal Article
Closed access
PDF file
MBMario R. F. Benevides
Mario R. F. Benevides
TMThomas S. E. Maibaum
Thomas S. E. Maibaum
This work provides a constructive presentation of modal logis in natural deduction style. The modal connective □ is presented in a constructive form, which can be considered as an operational semantics for it. Modal connectives have been recognized as intentional connectives for a long time, but modal logicians have insisted in using extensional techniques to deal with them. In this paper, the modal connective is presented as a higher-order connective defined on top of the object level logical connectives. The simplest version of our system of modal logic with classical negation coincides with the classical modal logic K. The most important modal logics have an elegant presentation in this system. T, S4, S5, D, D4, D5 are presented, without any side effect condition on the structure of the deductions. Most presentations of intuitionistic modal logics fail in giving an intuitionistic interpretation to the modal connective. In general, such interpretations are based on some alien element (for instance, the accessibility relation), which are by no means intuitionistic. In the system described here it is not only possible to present an intuitionistic interpretation of the modal connective □, which takes into account only deducibility issues, but also to give a constructive natural deduction presentation for the □.

1 February 2022 in Journal of Logical and Algebraic Methods in Programming
Verified
Journal Article
Closed access
MBMário Benevides
Mário Benevides
AMAlexandre Madeira
Alexandre Madeira
MMManuel A. Martins
Manuel A. Martins

25 April 2014 in Logic Journal of the IGPL
Verified
Journal Article
Closed access
PDF file
BLBruno Lopes
Bruno Lopes
MBMario Benevides
Mario Benevides
PJPontifícia Universidade Católica do Hermann de Janeiro
Pontifícia Universidade Católica do Hermann de Janeiro
Propositional Dynamic Logic (PDL) is a multi-modal logic used for specifying and reasoning on sequential programs. Petri Net is a widely used formalism to specify and to analyse concurrent programs with a very nice graphical representation. In this work, we propose a PDL to reasoning about Petri Nets. First we define a compositional encoding of Petri Nets from basic nets as terms. Second, we use these terms as PDL programs and provide a compositional semantics to PDL Formulas. Finally, we present an axiomatization and prove completeness w.r.t. our semantics. The advantage of our approach is that we can do reasoning about Petri Nets using our dynamic logic and we do not need to to translate it to other formalisms. Moreover our approach is compositional allowing for construction of complex nets using basic ones.