Sciweavers

681 search results - page 36 / 137
» A Logic for True Concurrency
Sort
View
LICS
1994
IEEE
15 years 1 months ago
A Fully Abstract Semantics for Concurrent Graph Reduction
abstract semantics for concurrent graph reduction ALAN JEFFREY This paper presents a fully abstract semantics for a variant of the untyped -calculus with recursive declarations. We...
Alan Jeffrey
ICLP
2003
Springer
15 years 2 months ago
Order and Negation as Failure
We equip ordered logic programs with negation as failure, using a simple generalization of the preferred answer set semantics for ordered programs. This extension supports a conven...
Davy Van Nieuwenborgh, Dirk Vermeir
CADE
1992
Springer
15 years 1 months ago
Isabelle-91
e introducing the types and constants of the logic, i.e. its abstract syntax, and axioms describing the inference rules. As a tiny example, consider the following definition of min...
Tobias Nipkow, Lawrence C. Paulson
DFT
2003
IEEE
246views VLSI» more  DFT 2003»
15 years 3 months ago
Low Cost Convolutional Code Based Concurrent Error Detection in FSMs
We discuss the use of convolutional codes to perform concurrent error detection (CED) in finite state machines (FSMs). We examine a previously proposed methodology, we identify i...
Konstantinos Rokas, Yiorgos Makris, Dimitris Gizop...
DFT
2002
IEEE
103views VLSI» more  DFT 2002»
15 years 2 months ago
Duplication-Based Concurrent Error Detection in Asynchronous Circuits: Shortcomings and Remedies
Concurrent error detection (CED) methods are typically employed to provide an indication of the operational health of synchronous circuits during normal functionality. Existing CE...
Thomas Verdel, Yiorgos Makris