Sciweavers

852 search results - page 136 / 171
» entcs 2010
Sort
View
ENTCS
2006
125views more  ENTCS 2006»
15 years 12 days ago
An Even Closer Integration of Linear Arithmetic into Inductive Theorem Proving
To broaden the scope of decision procedures for linear arithmetic, they have to be integrated into theorem provers. Successful approaches e.g. in NQTHM or ACL2 suggest a close int...
Tobias Schmidt-Samoa
ENTCS
2006
136views more  ENTCS 2006»
15 years 12 days ago
Adaptive Application of SAT Solving Techniques
New heuristics and strategies have enabled major advancements in SAT solving in recent years. However, experimentation has shown that there is no winning solution that works in al...
Ohad Shacham, Karen Yorav
ENTCS
2006
111views more  ENTCS 2006»
15 years 12 days ago
Token-Passing Nets: Call-by-Need for Free
Recently, encodings in interaction nets of the call-by-name and call-by-value strategies of the -calculus have been proposed. The purpose of these encodings was to he gap between ...
François-Régis Sinot
ENTCS
2006
135views more  ENTCS 2006»
15 years 12 days ago
Initializing Mutually Referential Abstract Objects: The Value Recursion Challenge
zing Mutually Referential Abstract Objects: The Value Recursion Challenge Don Syme 1 Microsoft Research, Cambridge, U.K. Mutual dependencies between objects arise frequently in pr...
Don Syme
118
Voted
ENTCS
2006
168views more  ENTCS 2006»
15 years 12 days ago
Case Study: Model Transformations for Time-triggered Languages
In this study, we introduce a model transformation tool for a time-triggered language: Giotto. The tool uses graphs to represent the source code (Giotto) and the target (the sched...
Tivadar Szemethy