Sciweavers

597 search results - page 27 / 120
» Formal Techniques for Java-Like Programs
Sort
View
SAS
2010
Springer
141views Formal Methods» more  SAS 2010»
13 years 7 months ago
Statically Inferring Complex Heap, Array, and Numeric Invariants
We describe Deskcheck, a parametric static analyzer that is able to establish properties of programs that manipulate dynamically allocated memory, arrays, and integers. Deskcheck c...
Bill McCloskey, Thomas W. Reps, Mooly Sagiv
JUCS
2006
92views more  JUCS 2006»
13 years 8 months ago
Program Slicing by Calculation
: Program slicing is a well known family of techniques used to identify code fragments which depend on or are depended upon specific program entities. They are particularly useful ...
Nuno F. Rodrigues, Luís Soares Barbosa
FM
2008
Springer
75views Formal Methods» more  FM 2008»
13 years 10 months ago
Masking Faults While Providing Bounded-Time Phased Recovery
We focus on synthesis techniques for transforming existing fault-intolerant real-time programs to fault-tolerant programs that provide phased recovery. A fault-tolerant program is ...
Borzoo Bonakdarpour, Sandeep S. Kulkarni
EMNLP
2009
13 years 6 months ago
Feature-Rich Translation by Quasi-Synchronous Lattice Parsing
We present a machine translation framework that can incorporate arbitrary features of both input and output sentences. The core of the approach is a novel decoder based on lattice...
Kevin Gimpel, Noah A. Smith
ICALP
2011
Springer
13 years 3 days ago
Liveness-Preserving Atomicity Abstraction
-Preserving Atomicity Abstraction Alexey Gotsman1 and Hongseok Yang2 1 IMDEA Software Institute 2 University of Oxford Modern concurrent algorithms are usually encapsulated in libr...
Alexey Gotsman, Hongseok Yang