Sciweavers

655 search results - page 96 / 131
» Automata, Logic, and XML
Sort
View
92
Voted
BDA
2006
14 years 11 months ago
Capturing well typed references in DTDs
Surprisingly enough, there has been few investigations for typing references of semistructured data and XML documents. This paper build on a previous proposal [7] introducing simp...
Nicole Bidoit, Dario Colazzo
FOSSACS
2007
Springer
15 years 3 months ago
PDL with Intersection and Converse Is 2 EXP-Complete
We study the complexity of satisfiability for the expressive extension ICPDL of PDL (Propositional Dynamic Logic), which admits intersection and converse as program operations. Ou...
Stefan Göller, Markus Lohrey, Carsten Lutz
FM
2003
Springer
174views Formal Methods» more  FM 2003»
15 years 2 months ago
Model-Checking TRIO Specifications in SPIN
We present a novel application on model checking through SPIN as a means for verifying purely descriptive specifications written in TRIO, a first order, linear-time temporal logic ...
Angelo Morzenti, Matteo Pradella, Pierluigi San Pi...
LPNMR
2001
Springer
15 years 2 months ago
Bounded LTL Model Checking with Stable Models
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. As the model of asynchronous syst...
Keijo Heljanko, Ilkka Niemelä
CSL
1999
Springer
15 years 2 months ago
Difference Decision Diagrams
This paper describes a new data structure, difference decision diagrams (DDDs), for representing a Boolean logic over inequalities of the form ¡£¢¥¤§¦©¨ and ¡¢¥¤...
Jesper B. Møller, Jakob Lichtenberg, Henrik...