Sciweavers

1176 search results - page 101 / 236
» Implicit Abstraction Heuristics
Sort
View
92
Voted
TASE
2007
IEEE
15 years 7 months ago
Automating Language Evolution
The design and implementation of complex software systems ly spans multiple levels of abstractions. The concepts of el of abstractions and their interplay are represented by forma...
Markus Pizka, Elmar Jürgens
99
Voted
IJCAI
1989
15 years 1 months ago
A Computational Framework for Granularity and its Application to Educational Diagnosis
Many artificial intelligence systems implicitly use notions of granularity in reasoning, but there is very little research into granularity itself. An exception is the work of Hob...
Jim E. Greer, Gordon I. McCalla
119
Voted
JSC
2002
84views more  JSC 2002»
15 years 8 days ago
A Constructive Algebraic Hierarchy in Coq
We describe a framework of algebraic structures in the proof assistant Coq. We have developed this framework as part of the FTA project in Nijmegen, in which a constructive proof ...
Herman Geuvers, Randy Pollack, Freek Wiedijk, Jan ...
166
Voted
ISOLA
2010
Springer
14 years 10 months ago
Context-Sensitivity in IPET for Measurement-Based Timing Analysis
Abstract. The Implicit Path Enumeration Technique (IPET) has become widely accepted as a powerful technique to compute upper bounds on the Worst-Case Execution Time (WCET) of time-...
Michael Zolda, Sven Bünte, Raimund Kirner
114
Voted
CADE
2007
Springer
16 years 28 days ago
Solving Quantified Verification Conditions Using Satisfiability Modulo Theories
Abstract. First order logic provides a convenient formalism for describing a wide variety of verification conditions. Two main approaches to checking such conditions are pure first...
Yeting Ge, Clark Barrett, Cesare Tinelli