Sciweavers

30 search results - page 4 / 6
» Encoding the Program Correctness Proofs as Programs in PCC T...
Sort
View
LPNMR
2001
Springer
14 years 3 days ago
Bounded LTL Model Checking with Stable Models
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. As the model of asynchronous syst...
Keijo Heljanko, Ilkka Niemelä
IAW
2003
IEEE
14 years 29 days ago
Insecure Programming: How Culpable is a Language's Syntax?
— Vulnerabilities in software stem from poorly written code. Inadvertent errors may creep in due to programmers not being aware of the security implications of their code. Writin...
Ramkumar Chinchani, Anusha Iyer, Bharat Jayaraman,...
JFP
2000
91views more  JFP 2000»
13 years 7 months ago
Uniform confluence in concurrent computation
Indeterminism is typical for concurrent computation. If several concurrent actors compete for the same resource then at most one of them may succeed, whereby the choice of the suc...
Joachim Niehren
TPHOL
2000
IEEE
13 years 11 months ago
Equational Reasoning via Partial Reflection
We modify the reflection method to enable it to deal with partial functions like division. The idea behind reflection is to program a tactic for a theorem prover not in the impleme...
Herman Geuvers, Freek Wiedijk, Jan Zwanenburg
ENTCS
2007
100views more  ENTCS 2007»
13 years 7 months ago
Type-Safe Code Transformations in Haskell
The use of typed intermediate languages can significantly increase the reliability of a compiler. By typechecking the code produced at each transformation stage, one can identify...
Louis-Julien Guillemette, Stefan Monnier