Sciweavers

351 search results - page 32 / 71
» Logic Programs with Compiled Preferences
Sort
View
POPL
2008
ACM
14 years 9 months ago
Formal verification of translation validators: a case study on instruction scheduling optimizations
Translation validation consists of transforming a program and a posteriori validating it in order to detect a modification of its semantics. This approach can be used in a verifie...
Jean-Baptiste Tristan, Xavier Leroy
AUSAI
2006
Springer
14 years 12 days ago
LPForget: A System of Forgetting in Answer Set Programming
Abstract. A novel declarative approach of forgetting in answer set programming (ASP) has been proposed recently. In this paper we report a system prototype of forgetting in ASP, ca...
Fu-Leung Cheng, Thomas Eiter, Nathan Robinson, Abd...
CORR
2007
Springer
99views Education» more  CORR 2007»
13 years 8 months ago
Machine structure oriented control code logic
Abstract. Control code is a concept that is closely related to a frequently occurring practitioner’s view on what is a program: code that is capable of controlling the behaviour ...
Jan A. Bergstra, C. A. Middelburg
TYPES
2000
Springer
14 years 6 days ago
Executing Higher Order Logic
We report on the design of a prototyping component for the theorem prover Isabelle/HOL. Specifications consisting of datatypes, recursive functions and inductive definitions are co...
Stefan Berghofer, Tobias Nipkow
CCS
2011
ACM
12 years 8 months ago
Automatically optimizing secure computation
On the one hand, compilers for secure computation protocols, such as FairPlay or FairPlayMP, have significantly simplified the development of such protocols. On the other hand, ...
Florian Kerschbaum