Sciweavers

3713 search results - page 307 / 743
» Constructing a Calculus of Programs
Sort
View
POPL
2006
ACM
16 years 4 months ago
Small bisimulations for reasoning about higher-order imperative programs
We introduce a new notion of bisimulation for showing contextual equivalence of expressions in an untyped lambda-calculus with an explicit store, and in which all expressed values...
Vasileios Koutavas, Mitchell Wand
HASE
2007
IEEE
15 years 10 months ago
On the Verifiability of Programs Written in the Feature Language Extensions
High assurance in embedded system software is difficult to attain. Verification relies on testing. The unreliable and costly testing process is made much worse because the softwar...
Wu-Hon F. Leung
PEPM
2007
ACM
15 years 10 months ago
Quasi-terminating logic programs for ensuring the termination of partial evaluation
A logic program strongly quasi-terminates when only a finite number of distinct atoms (modulo variable renaming) are derivable from any given query and computation rule. This noti...
Germán Vidal
PLDI
2004
ACM
15 years 9 months ago
Cost effective dynamic program slicing
Although dynamic program slicing was first introduced to aid in user level debugging, applications aimed at improving software quality, reliability, security, and performance hav...
Xiangyu Zhang, Rajiv Gupta
EMSOFT
2004
Springer
15 years 9 months ago
A typed assembly language for real-time programs
We present a type system for E code, which is an assembly language that manages the release, interaction, and termination of real-time tasks. E code specifies a deadline for each...
Thomas A. Henzinger, Christoph M. Kirsch