Sciweavers

60 search results - page 11 / 12
» Automata and temporal logic over arbitrary linear time
Sort
View
ICLP
1997
Springer
13 years 9 months ago
The Complexity of Model Checking in Modal Event Calculi
Kowalski and Sergot’s Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which propert...
Iliano Cervesato, Massimo Franceschet, Angelo Mont...
ICDT
2009
ACM
125views Database» more  ICDT 2009»
14 years 6 months ago
How big must complete XML query languages be?
Marx and de Rijke have shown that the navigational core of the w3c XML query language XPath is not first-order complete ? that is it cannot express every query definable in firsto...
Clemens Ley, Michael Benedikt
CAV
2010
Springer
172views Hardware» more  CAV 2010»
13 years 9 months ago
Symbolic Bounded Synthesis
Abstract. Synthesis of finite state systems from full linear time temporal logic (LTL) specifications is gaining more and more attention as several recent achievements have signi...
Rüdiger Ehlers
CSL
2004
Springer
13 years 10 months ago
Parameterized Model Checking of Ring-Based Message Passing Systems
The Parameterized Model Checking Problem (PMCP) is to decide whether a temporal property holds for a uniform family of systems,  ¢¡ , comprised of finite, but arbitrarily many,...
E. Allen Emerson, Vineet Kahlon
IJCSA
2006
95views more  IJCSA 2006»
13 years 5 months ago
Modeling and Formal Verification of DHCP Using SPIN
The Dynamic Host Configuration Protocol (DHCP) is a widely used communication protocol. In this paper, a portion of the protocol is chosen for modeling and verification, namely th...
Syed M. S. Islam, Mohammed H. Sqalli, Sohel Khan