Sciweavers

217 search results - page 8 / 44
» A New Approach to Abstract Syntax with Variable Binding
Sort
View
TACAS
2007
Springer
124views Algorithms» more  TACAS 2007»
14 years 2 months ago
Deciding Bit-Vector Arithmetic with Abstraction
ion Randal E. Bryant1 , Daniel Kroening2 , Jo¨el Ouaknine3 , Sanjit A. Seshia4 , Ofer Strichman5 , and Bryan Brady4 1 Carnegie Mellon University, Pittsburgh 2 ETH Z¨urich 3 Oxfor...
Randal E. Bryant, Daniel Kroening, Joël Ouakn...
TPHOL
2009
IEEE
14 years 3 months ago
The HOL-Omega Logic
A new logic is posited for the widely used HOL theorem prover, as an extension of the existing higher order logic of the HOL4 system. The logic is extended to three levels, adding ...
Peter V. Homeier
LICS
2010
IEEE
13 years 7 months ago
Abstracting the Differential Semantics of Rule-Based Models: Exact and Automated Model Reduction
ing the differential semantics of rule-based models: exact and automated model reduction (Invited Lecture) Vincent Danos∗§, J´erˆome Feret†, Walter Fontana‡, Russell Harme...
Vincent Danos, Jérôme Feret, Walter F...
RECOMB
2005
Springer
14 years 9 months ago
Segmentation Conditional Random Fields (SCRFs): A New Approach for Protein Fold Recognition
Abstract. Protein fold recognition is an important step towards understanding protein three-dimensional structures and their functions. A conditional graphical model, i.e. segmenta...
Yan Liu, Jaime G. Carbonell, Peter Weigele, Vanath...
EUROPAR
2000
Springer
14 years 6 days ago
Novel Models for Or-Parallel Logic Programs: A Performance Analysis
One of the advantages of logic programming is the fact that it offers many sources of implicit parallelism, such as and-parallelism and or-parallelism. Arguably, or-parallel system...
Vítor Santos Costa, Ricardo Rocha, Fernando...