Sciweavers

290 search results - page 33 / 58
» The Formal Execution Semantics of SpecC
Sort
View
WOLLIC
2009
Springer
15 years 4 months ago
Forcing-Based Cut-Elimination for Gentzen-Style Intuitionistic Sequent Calculus
We give a simple intuitionistic completeness proof of Kripke semantics with constant domain for intuitionistic logic with implication and universal quantification. We use a cut-fr...
Hugo Herbelin, Gyesik Lee
TLCA
2005
Springer
15 years 3 months ago
Can Proofs Be Animated By Games?
Proof animation is a way of executing proofs to nd errors in the formalization of proofs. It is intended to be \testing in proof engineering". Although the realizability inter...
Susumu Hayashi
75
Voted
ERSA
2006
109views Hardware» more  ERSA 2006»
14 years 11 months ago
Synthesis of Object Oriented Models on Reconfigurable Hardware
Abstract-- In this work the problem of modeling reconfigurable systems behavior with a precise, executable semantics is considered. The possibility of synthesising such models onto...
Giovanni Agosta, Francesco Bruschi, Marco D. Santa...
80
Voted
TLDI
2010
ACM
210views Formal Methods» more  TLDI 2010»
15 years 6 months ago
Effects for cooperable and serializable threads
Reasoning about the correctness of multithreaded programs is complicated by the potential for unexpected interference between threads. Previous work on controlling thread interfer...
Jaeheon Yi, Cormac Flanagan
WWW
2003
ACM
15 years 10 months ago
SweetDeal: representing agent contracts with exceptions using XML rules, ontologies, and process descriptions
SweetDeal is a rule-based approach to representation of business contracts that enables software agents to create, evaluate, negotiate, and execute contracts with substantial auto...
Benjamin N. Grosof, Terrence C. Poon