Sciweavers

65 search results - page 9 / 13
» Test generation through programming in UDITA
Sort
View
POPL
2010
ACM
14 years 4 months ago
Compositional May-Must Program Analysis: Unleashing the Power of Alternation
Program analysis tools typically compute two types of information: (1) may information that is true of all program executions and is used to prove the absence of bugs in the progr...
Aditya V. Nori, Patrice Godefroid, SaiDeep Tetali,...
AIR
2004
130views more  AIR 2004»
13 years 7 months ago
A Hybrid Framework for Over-Constrained Generalized
Abstract. In this work we study an over-constrained scheduling problem where constraints cannot be relaxed. This problem originates from a local defense agency where activities to ...
Andrew Lim, Brian Rodrigues, Ramesh Thangarajo, Fe...
ACL
2009
13 years 5 months ago
Unsupervised Multilingual Grammar Induction
We investigate the task of unsupervised constituency parsing from bilingual parallel corpora. Our goal is to use bilingual cues to learn improved parsing models for each language ...
Benjamin Snyder, Tahira Naseem, Regina Barzilay
SIGSOFT
2004
ACM
14 years 28 days ago
Automating comprehensive safety analysis of concurrent programs using verisoft and TXL
In run-time safety analysis the executions of a concurrent program are monitored and analyzed with respect to safety properties. Similar to testing, run-time analysis is quite eï¬...
Jürgen Dingel, Hongzhi Liang
ASE
2005
140views more  ASE 2005»
13 years 7 months ago
Automated Procedure Construction for Deductive Synthesis
Deductive program synthesis systems based on automated theorem proving offer the promise of software that is correct by construction. However, the difficulty encountered in constru...
Steve Roach, Jeffrey Van Baalen