Sciweavers

1210 search results - page 169 / 242
» Formal Techniques for Java Programs
Sort
View
ICSE
2003
IEEE-ACM
14 years 7 months ago
Improving Test Suites via Operational Abstraction
g Test Suites via Operational Abstraction Michael Harder Jeff Mellen Michael D. Ernst MIT Lab for Computer Science 200 Technology Square Cambridge, MA 02139 USA {mharder,jeffm,mern...
Michael Harder, Jeff Mellen, Michael D. Ernst
SAS
2001
Springer
117views Formal Methods» more  SAS 2001»
14 years 4 days ago
Finite-Tree Analysis for Constraint Logic-Based Languages
Abstract. Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the omission of t...
Roberto Bagnara, Roberta Gori, Patricia M. Hill, E...
JUCS
2007
98views more  JUCS 2007»
13 years 7 months ago
Using Visitor Patterns in Object-Oriented Action Semantics
Abstract: Object-Oriented Action Semantics is a semantic framework for the definition of programming languages. The framework incorporates some object-oriented concepts to the Act...
André Murbach Maidl, Cláudio Carvilh...
CADE
2005
Springer
14 years 8 months ago
An Algorithm for Deciding BAPA: Boolean Algebra with Presburger Arithmetic
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
Viktor Kuncak, Huu Hai Nguyen, Martin C. Rinard
APLAS
2006
ACM
14 years 1 months ago
A Bytecode Logic for JML and Types
This document contains the Isabelle/HOL sources underlying our paper A bytecode logic for JML and types [2], updated to Isabelle 2008. We present a program logic for a subset of s...
Lennart Beringer, Martin Hofmann