2127 search results - page 206 / 426 » Software Automation |
135
click to vote
ECSQARU
1997
Springer
15 years 10 months ago
1997
Springer
Abstract. Today, different formalisms exist to solve reasoning problems under uncertainty. For most of the known formalisms, corresponding computer implementations are available. ...
162
click to vote
TPHOL
1996
IEEE
15 years 10 months ago
1996
IEEE
Nuprl and HOL are both tactic-based interactive theorem provers for higher-order logic, and both have been used in many substantial applications over the last decade. However, the ...
158
click to vote
LICS
2000
IEEE
15 years 10 months ago
2000
IEEE
Equality and subtyping of recursive types have been studied in the 1990s by Amadio and Cardelli; Kozen, Palsberg, and Schwartzbach; Brandt and Henglein; and others. Potential appl...
176
click to vote
FM
2008
Springer
15 years 8 months ago
2008
Springer
Interface automata provide a formalism capturing the high level interactions between software components. Checking compatibility, and other safety properties, in an automata-based ...
156
click to vote
SPLC
2008
15 years 8 months ago
2008
The automated analysis of Feature Models (FMs) focuses on the usage of different logic paradigms and solvers to implement a number of analysis operations on FMs. The implementatio...