Sciweavers

3513 search results - page 512 / 703
» Super Logic Programs
Sort
View
115
Voted
LICS
2002
IEEE
15 years 5 months ago
A Syntactic Approach to Foundational Proof-Carrying Code
Proof-Carrying Code (PCC) is a general framework for verifying the safety properties of machine-language programs. PCC proofs are usually written in a logic extended with language...
Nadeem Abdul Hamid, Zhong Shao, Valery Trifonov, S...
ICALP
2010
Springer
15 years 5 months ago
Automata for Coalgebras: An Approach Using Predicate Liftings
Universal Coalgebra provides the notion of a coalgebra as the natural mathematical generalization of state-based evolving systems such as (infinite) words, trees, and transition s...
Gaëlle Fontaine, Raul Andres Leal, Yde Venema
119
Voted
FCCM
2000
IEEE
105views VLSI» more  FCCM 2000»
15 years 5 months ago
Configuration Relocation and Defragmentation for Reconfigurable Computing
Custom computing systems exhibit significant speedups over traditional microprocessors by mapping compute-intensive sections of a program to reconfigurable logic [Hauck98]. Howeve...
Katherine Compton, James Cooley, Stephen Knol, Sco...
99
Voted
IPPS
2000
IEEE
15 years 5 months ago
Deterministic Replay of Distributed Java Applications
Execution behavior of a Java application can be nondeterministic due to concurrent threads of execution, thread scheduling, and variable network delays. This nondeterminism in Jav...
Ravi B. Konuru, Harini Srinivasan, Jong-Deok Choi
87
Voted
ICLP
1999
Springer
15 years 5 months ago
Computing Large and Small Stable Models
In this paper, we focus on the problem of existence of and computing small and large stable models. We show that for every xed integer k, there is a linear-time algorithm to decid...
Miroslaw Truszczynski