Sciweavers

529 search results - page 58 / 106
» Simple Random Logic Programs
Sort
View
POPL
2012
ACM
12 years 5 months ago
Recursive proofs for inductive tree data-structures
We develop logical mechanisms and decision procedures to facilitate the verification of full functional properties of inductive tree data-structures using recursion that are soun...
Parthasarathy Madhusudan, Xiaokang Qiu, Andrei Ste...
STOC
2001
ACM
123views Algorithms» more  STOC 2001»
14 years 10 months ago
On optimal slicing of parallel programs
Optimal program slicing determines for a statement S in a program whether or not S affects a specified set of statements, given that all conditionals in are interpreted as non-d...
Markus Müller-Olm, Helmut Seidl
TCAD
2008
101views more  TCAD 2008»
13 years 9 months ago
Using Field-Repairable Control Logic to Correct Design Errors in Microprocessors
Functional correctness is a vital attribute of any hardware design. Unfortunately, due to extremely complex architectures, widespread components, such as microprocessors, are often...
Ilya Wagner, Valeria Bertacco, Todd M. Austin
LOPSTR
2009
Springer
14 years 4 months ago
LP with Flexible Grouping and Aggregates Using Modes
We propose a new grouping operator for logic programs based on the group_by operator of SQL. The novelty of our proposal lies in the use of modes, which allows us to relax some rat...
Marcin Czenko, Sandro Etalle
IFIP
2004
Springer
14 years 3 months ago
Prototyping Proof Carrying Code
Abstract We introduce a generic framework for proof carrying code, developed and mechanically verified in Isabelle/HOL. The framework defines and proves sound a verification con...
Martin Wildmoser, Tobias Nipkow, Gerwin Klein, Seb...