Sciweavers

386 search results - page 43 / 78
» Debugging Logic Programs Using Specifications
Sort
View
POPL
2010
ACM
14 years 7 months ago
Generating Compiler Optimizations from Proofs
We present an automated technique for generating compiler optimizations from examples of concrete programs before and after improvements have been made to them. The key technical ...
Ross Tate, Michael Stepp, Sorin Lerner
ENTCS
2008
170views more  ENTCS 2008»
13 years 10 months ago
A Coq Library for Verification of Concurrent Programs
Thanks to recent advances, modern proof assistants now enable verification of realistic sequential programs. However, regarding the concurrency paradigm, previous work essentially...
Reynald Affeldt, Naoki Kobayashi
CORR
2010
Springer
151views Education» more  CORR 2010»
13 years 10 months ago
Redundancies in Dependently Typed Lambda Calculi and Their Relevance to Proof Search
Dependently typed -calculi such as the Logical Framework (LF) are capable of representing relationships between terms through types. By exploiting the "formulas-as-types"...
Zachary Snow, David Baelde, Gopalan Nadathur
ESWS
2007
Springer
14 years 4 months ago
A Reasoning Framework for Rule-Based WSML
WSML is an ontology language specifically tailored to annotate Web Services, and part of its semantics adheres to the rule-based knowledge representation paradigm of logic program...
Stephan Grimm, Uwe Keller, Holger Lausen, Gá...
SEW
2003
IEEE
14 years 3 months ago
Applying Run-Time Monitoring to the Deep-Impact Fault Protection Engine
Run-time monitoring is a lightweight verification method whereby the correctness of a programs’ execution is verified at run-time using executable specifications. This paper des...
Doron Drusinsky, Garth Watney