Sciweavers

1391 search results - page 171 / 279
» Completeness of Neighbourhood Logic
Sort
View
POPL
2004
ACM
14 years 10 months ago
A bisimulation for dynamic sealing
We define seal, an untyped call-by-value -calculus with primitives for protecting abstract data by sealing, and develop a bisimulation proof method that is sound and complete with...
Eijiro Sumii, Benjamin C. Pierce
CADE
2008
Springer
14 years 10 months ago
Engineering DPLL(T) + Saturation
Satisfiability Modulo Theories (SMT) solvers have proven highly scalable, efficient and suitable for integrated theory reasoning. The most efficient SMT solvers rely on refutationa...
Leonardo Mendonça de Moura, Nikolaj Bj&osla...
DDECS
2009
IEEE
95views Hardware» more  DDECS 2009»
14 years 4 months ago
Self-timed full adder designs based on hybrid input encoding
—Self-timed full adder designs based on commercial synchronous resources (standard cells), constructed using a mix of complete delay-insensitive codes adopted for inputs are desc...
Padnamabhan Balasubramanian, D. A. Edwards, C. Bre...
TASE
2009
IEEE
14 years 4 months ago
Semantics of Metamodels in UML
A modelling language can be defined by a metamodel in UML class diagram. This paper defines the semantics of such metamodels through two mappings: a signature mapping from metamod...
Lijun Shan, Hong Zhu
LFCS
2009
Springer
14 years 4 months ago
A Labeled Natural Deduction System for a Fragment of CTL*
We give a sound and complete labeled natural deduction system for an interesting fragment of CTL∗ , namely the until-free version of BCTL∗ . The logic BCTL∗ is obtained by re...
Andrea Masini, Luca Viganò, Marco Volpe