#### Filter Results:

- Full text PDF available (9)

#### Publication Year

2006

2015

- This year (0)
- Last 5 years (4)
- Last 10 years (16)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Mario R. F. Benevides, L. Menasché Schechter
- Electr. Notes Theor. Comput. Sci.
- 2008

Graphs are among the most frequently used structures in Computer Science. In this work, we analyze how we can express some important graph properties such as connectivity, acyclicity and the Eulerian… (More)

- Mario R. F. Benevides, L. Menasché Schechter
- Logic Journal of the IGPL
- 2009

Graphs are among the most frequently used structures in Computer Science. Some of the properties that must be checked in many applications are connectivity, acyclicity and the Eulerian and… (More)

- Mario R. F. Benevides, L. Menasché Schechter
- WoLLIC
- 2008

This work presents a Propositional Dynamic Logic in which the programs are CCS terms (CCS-PDL). Its goal is to reason about properties of concurrent systems specified in CCS. CCS is a process algebra… (More)

- S. C. Coutinho, L. Menasché Schechter
- J. Symb. Comput.
- 2006

We present two algorithms that can be used to check whether a given holomorphic foliation of the projective plane has an algebraic solution, and discuss the performance of their implementations in… (More)

We present an algorithm that can be used to check whether a given derivation of the complex affine plane has an invariant algebraic curve and discuss the performance of its implementation in the… (More)

- L. Menasché Schechter
- Theor. Comput. Sci.
- 2015

In this work, we combine the frameworks of Justification Logics and Logics of Plausibility-Based Beliefs to build a logic for MultiAgent Systems where each agent can explicitly state his… (More)

In 1997, Goldreich, Goldwasser and Halevi presented the GGH cryptosystem, which is based on hard lattice problems. Only two years later, Nguyen pointed out major flaws on the scheme. From that point… (More)

Hybrid logics with the ↓ operator are generally undecidable. In this paper, we present a fragment of the hybrid CTL with the ↓ operator (HCTL(@,↓)), called the reducible fragment, that has the same… (More)

- Mario R. F. Benevides, L. Menasché Schechter
- J. Log. Comput.
- 2014

This work presents three increasingly expressive Dynamic Logics in which the programs are described in a language based on CCS. Our goal is to build dynamic logics that are suitable for the… (More)

- Mario R. F. Benevides, L. Menasché Schechter
- ArXiv
- 2009

This work presents three increasingly expressive Dynamic Logics in which the programs are CCS processes (sCCS-PDL, CCS-PDL and XCCSPDL). Their goal is to reason about properties of concurrent… (More)