Sciweavers

271 search results - page 30 / 55
» A comparison between two logical formalisms for rewriting
Sort
View
ECSQARU
2009
Springer
14 years 2 months ago
Merging Belief Bases Represented by Logic Programs
Abstract. This paper presents a method which allows for merging beliefs expressed thanks to logic programming with stable model semantics. This method is based on the syntactic mer...
Julien Hué, Odile Papini, Eric Würbel
CIIA
2009
13 years 9 months ago
LCF-style for Secure Verification Platform based on Multiway Decision Graphs
Abstract. Formal verification of digital systems is achieved, today, using one of two main approaches: states exploration (mainly model checking and equivalence checking) or deduct...
Sa'ed Abed, Otmane Aït Mohamed
CHARME
2001
Springer
162views Hardware» more  CHARME 2001»
13 years 11 months ago
Parameterized Verification of the FLASH Cache Coherence Protocol by Compositional Model Checking
We consider the formal verification of the cache coherence protocol of the Stanford FLASH multiprocessor for N processors. The proof uses the SMV proof assistant, a proof system ba...
Kenneth L. McMillan
SIGSOFT
2005
ACM
14 years 8 months ago
Fluent temporal logic for discrete-time event-based models
Fluent model checking is an automated technique for verifying that an event-based operational model satisfies some state-based declarative properties. The link between the event-b...
Emmanuel Letier, Jeff Kramer, Jeff Magee, Sebasti&...
EMSOFT
2011
Springer
12 years 7 months ago
Synthesis of optimal switching logic for hybrid systems
Given a multi-modal dynamical system, optimal switching logic synthesis involves generating conditions for switching between the system modes such that the resulting hybrid system...
Susmit Jha, Sanjit A. Seshia, Ashish Tiwari