Sciweavers

1264 search results - page 212 / 253
» Abstract machines for programming language implementation
Sort
View
TPHOL
1999
IEEE
15 years 6 months ago
Three Tactic Theorem Proving
Abstract. We describe the key features of the proof description language of Declare, an experimental theorem prover for higher order logic. We take a somewhat radical approach to p...
Don Syme
VSTTE
2005
Springer
15 years 8 months ago
Implications of a Data Structure Consistency Checking System
Abstract. We present a framework for verifying that programs correctly preserve important data structure consistency properties. Results from our implemented system indicate that o...
Viktor Kuncak, Patrick Lam, Karen Zee, Martin C. R...
112
Voted
APL
1992
ACM
15 years 6 months ago
Compiler Tools in APL
We present the design and implementation of APL Intrinsic Functions for a Finite State Machine (also known as a Finite State Automaton) which recognizes regular languages, and a P...
Robert Bernecky, Gert Osterburg
EUROSYS
2009
ACM
15 years 11 months ago
xCalls: safe I/O in memory transactions
Memory transactions, similar to database transactions, allow a programmer to focus on the logic of their program and let the system ensure that transactions are atomic and isolate...
Haris Volos, Andres Jaan Tack, Neelam Goyal, Micha...
LICS
2002
IEEE
15 years 7 months ago
A Syntactic Approach to Foundational Proof-Carrying Code
Proof-Carrying Code (PCC) is a general framework for verifying the safety properties of machine-language programs. PCC proofs are usually written in a logic extended with language...
Nadeem Abdul Hamid, Zhong Shao, Valery Trifonov, S...