Sciweavers

475 search results - page 7 / 95
» Temporal Logic Model Checking (Abstract)
Sort
View
ENTCS
2007
158views more  ENTCS 2007»
13 years 7 months ago
Abstraction and Completeness for Real-Time Maude
ion and Completeness for Real-Time Maude Peter Csaba ¨Olveczky a,b and Jos´e Meseguer b a Department of Informatics, University of Oslo b Department of Computer Science, Universi...
Peter Csaba Ölveczky, José Meseguer
CADE
2002
Springer
14 years 7 months ago
Lazy Theorem Proving for Bounded Model Checking over Infinite Domains
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
Harald Rueß, Leonardo Mendonça de Mou...
IANDC
2011
127views more  IANDC 2011»
13 years 2 months ago
On the consistency, expressiveness, and precision of partial modeling formalisms
Partial transition systems support abstract model checking of complex temporal propercombining both over- and under-approximatingabstractions into a single model. Over the years, ...
Ou Wei, Arie Gurfinkel, Marsha Chechik
ATAL
2005
Springer
14 years 26 days ago
Temporal logics for normative agent communication protocols
We sketch how to express typical features of agent communication protocols in a simple temporal logic and show that conformance verification at runtime reduces to a generalised f...
Ulle Endriss
DBPL
2001
Springer
113views Database» more  DBPL 2001»
13 years 12 months ago
Model-Checking Based Data Retrieval
In this paper we develop a new method for solving queries on semistructured data. The main idea is to see a database as a Kripke Transition System (a model) and a query as a formul...
Agostino Dovier, Elisa Quintarelli