Sciweavers

1313 search results - page 211 / 263
» Prioritized Reasoning in Logic Programming
Sort
View
ISSTA
2010
ACM
15 years 1 months ago
Automated fixing of programs with contracts
In program debugging, finding a failing run is only the first step; what about correcting the fault? Can we automate the second task as well as the first? The AutoFix-E tool au...
Yi Wei, Yu Pei, Carlo A. Furia, Lucas S. Silva, St...
SIGSOFT
2007
ACM
15 years 10 months ago
Programming asynchronous layers with CLARITY
Asynchronous systems components are hard to write, hard to reason about, and (not coincidentally) hard to mechanically verify. In order to achieve high performance, asynchronous c...
Prakash Chandrasekaran, Christopher L. Conway, Jos...
CSL
2007
Springer
15 years 3 months ago
Proofs, Programs and Abstract Complexity
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ...
Arnold Beckmann
BMCBI
2002
126views more  BMCBI 2002»
14 years 9 months ago
RIO: Analyzing proteomes by automated phylogenomics using resampled inference of orthologs
Background: When analyzing protein sequences using sequence similarity searches, orthologous sequences (that diverged by speciation) are more reliable predictors of a new protein&...
Christian M. Zmasek, Sean R. Eddy
SAS
1995
Springer
127views Formal Methods» more  SAS 1995»
15 years 1 months ago
Complementation in Abstract Interpretation
ntation in Abstract Interpretation AGOSTINO CORTESI Universit`a di Venezia GILBERTO FIL´E Universit`a di Padova ROBERTO GIACOBAZZI Universit`a di Pisa CATUSCIA PALAMIDESSI Univers...
Agostino Cortesi, Gilberto Filé, Roberto Gi...