Sciweavers

3470 search results - page 322 / 694
» Head-Elementary-Set-Free Logic Programs
Sort
View
POPL
2004
ACM
16 years 7 months ago
Simple relational correctness proofs for static analyses and program transformations
We show how some classical static analyses for imperative programs, and the optimizing transformations which they enable, may be expressed and proved correct using elementary logi...
Nick Benton
TASE
2009
IEEE
16 years 1 months ago
The Logical Approach to Low-Level Stack Reasoning
—Formal verification of low-level programs often requires explicit reasoning and specification of runtime stacks. Treating stacks naively as parts of ordinary heaps can lead to...
Xinyu Jiang, Yu Guo, Yiyun Chen
OORASE
1999
Springer
15 years 11 months ago
OpenJava: A Class-Based Macro System for Java
This paper presents OpenJava, which is a macro system that we have developed for Java. With traditional macro systems designed for non object-oriented languages, it is difficult to...
Michiaki Tatsubori, Shigeru Chiba, Kozo Itano, Mar...
ICLP
1993
Springer
15 years 10 months ago
Turbo Erlang: Approaching the Speed of C
Erlang is a concurrent programming language designed for prototyping and implementing reliable real-time systems. In its design Erlanginherits someideas fromconcurrent logic progra...
Bogumil Hausman
CORR
2010
Springer
152views Education» more  CORR 2010»
15 years 6 months ago
A Non-Null Annotation Inferencer for Java Bytecode
We present a non-null annotations inferencer for the Java bytecode language. We previously proposed an analysis to infer non-null annotations and proved it soundness and completen...
Laurent Hubert