Sciweavers

456 search results - page 17 / 92
» The Logical Execution Time Paradigm
Sort
View
IPPS
2003
IEEE
14 years 2 months ago
So Many States, So Little Time: Verifying Memory Coherence in the Cray X1
This paper investigates a complexity-effective technique for verifying a highly distributed directory-based cache coherence protocol. We develop a novel approach called “witnes...
Dennis Abts, Steve Scott, David J. Lilja
ENTCS
2006
114views more  ENTCS 2006»
13 years 8 months ago
Run-Time Checking of Dynamic Properties
We consider a first-order property specification language for run-time monitoring of dynamic systems. The language is based on a linear-time temporal logic and offers two kinds of...
Oleg Sokolsky, Usa Sammapun, Insup Lee, Jesung Kim
CADE
2007
Springer
14 years 9 months ago
ALICE: An Advanced Logic for Interactive Component Engineering
This paper presents an overview of the verication framework ALICE in its current version 0.7. It is based on the generic theorem prover Isabelle [Pau03a]. Within ALICE a software o...
Borislav Gajanovic, Bernhard Rumpe
LICS
2010
IEEE
13 years 6 months ago
Datalog+/-: A Family of Logical Knowledge Representation and Query Languages for New Applications
Abstract--This paper summarizes results on a recently introduced family of Datalog-based languages, called Datalog+/-, which is a new framework for tractable ontology querying, and...
Andrea Calì, Georg Gottlob, Thomas Lukasiew...
TACAS
2012
Springer
263views Algorithms» more  TACAS 2012»
12 years 4 months ago
Reachability under Contextual Locking
Abstract. The pairwise reachability problem for a multi-threaded program asks, given control locations in two threads, whether they can be simultaneously reached in an execution of...
Rohit Chadha, P. Madhusudan, Mahesh Viswanathan