Sciweavers

903 search results - page 45 / 181
» Completeness Results for Memory Logics
Sort
View
PLDI
2011
ACM
14 years 9 months ago
Separation logic + superposition calculus = heap theorem prover
Program analysis and verification tools crucially depend on the ability to symbolically describe and reason about sets of program behaviors. Separation logic provides a promising...
Juan Antonio Navarro Pérez, Andrey Rybalche...
CORR
2011
Springer
170views Education» more  CORR 2011»
14 years 10 months ago
A Modular Type-checking algorithm for Type Theory with Singleton Types and Proof Irrelevance
We define a logical framework with singleton types and one universe of small types. We give the semantics using a PER model; it is used for constructing a normalisation-by-evaluat...
Andreas Abel, Thierry Coquand, Miguel Pagano
NMR
2004
Springer
15 years 11 months ago
Semantics of disjunctive programs with monotone aggregates - an operator-based approach
All major semantics of normal logic programs and normal logic programs with aggregates can be described as fixpoints of the one-step provability operator or of operators that can...
Nikolay Pelov, Miroslaw Truszczynski
RTAS
2010
IEEE
15 years 4 months ago
DARTS: Techniques and Tools for Predictably Fast Memory Using Integrated Data Allocation and Real-Time Task Scheduling
—Hardware-managed caches introduce large amounts of timing variability, complicating real-time system design. One alternative is a memory system with scratchpad memories which im...
Sangyeol Kang, Alexander G. Dean
ESWS
2009
Springer
16 years 26 days ago
Decidability of SHI with Transitive Closure of Roles
This paper investigates a Description Logic, namely SHI+, which extends SHI by adding transitive closure of roles. The resulting logic SHI+ allows transitive closure of roles to oc...
Chan Le Duc