Sciweavers

3713 search results - page 576 / 743
» Constructing a Calculus of Programs
Sort
View
AAAI
1990
14 years 11 months ago
Mechanizing Inductive Reasoning
Automating proofs by induction is important in many computer science and artificial intelligence applications, in particular in program verification and specification systems. We ...
Emmanuel Kounalis, Michaël Rusinowitch
ANOR
2007
126views more  ANOR 2007»
14 years 10 months ago
Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
In this survey we attempt to give a unified presentation of a variety of results on the lifting of valid inequalities, as well as a standard procedure combining mixed integer roun...
Quentin Louveaux, Laurence A. Wolsey
CONCURRENCY
2008
60views more  CONCURRENCY 2008»
14 years 10 months ago
Steering via the image in local, distributed and collaborative settings
Computational steering is a valuable mechanism for scientific investigation in which the parameters of a running program can be altered and the results visualized immediately. In ...
J. D. Wood, H. Wright
ENTCS
2008
118views more  ENTCS 2008»
14 years 10 months ago
Barbed Model-Driven Software Development: A Case Study
When thinking of MDE, the immediate understanding is that models drive software development, in the at the software is constructed by transforming models from higher levels of abs...
Carlo Montangero, Laura Semini
ENTCS
2008
97views more  ENTCS 2008»
14 years 10 months ago
An Algorithm for Approximating the Satisfiability Problem of High-level Conditions
The satisfiability problem is the fundamental problem in proving the conflict-freeness of specifications, or in finding a counterexample for an invalid statement. In this paper, w...
Karl-Heinz Pennemann