150 search results - page 4 / 30 » Counting Results in Weak Formalisms |
LOPSTR
2004
Springer
14 years 2 months ago
2004
Springer
For use in earlier approaches to automated module interface adaptation, we seek a restricted form of program synthesis. Given some typing assumptions and a desired result type, we ...
DAC
2001
ACM
14 years 9 months ago
2001
ACM
roperty Verification by Abstraction Refinement with Formal, Simulation and Hybrid Engines Dong Wang , Pei-Hsin Ho , Jiang Long , James Kukula Yunshan Zhu , Tony Ma , Robert D...
ICCS
2003
Springer
14 years 2 months ago
2003
Springer
The exact enumeration of most interesting combinatorial problems has exponential computational complexity. The finite-lattice method reduces this complexity for most two-dimension...
ASWEC
1998
IEEE
14 years 1 months ago
1998
IEEE
This paper reports the results from an action research project which studies the benefits of documenting the evolution and the rationale for the evolution of a requirements specif...
JAPLL
2008
13 years 8 months ago
2008
Abstract. The paper proposes a logical systematization of the notion of countsas which is grounded on a very simple intuition about what counts-as statements actually mean, i.e., f...