Sciweavers

1809 search results - page 106 / 362
» Software Model Checking Using Linear Constraints
Sort
View
AUTOMATICA
2002
104views more  AUTOMATICA 2002»
13 years 9 months ago
Who needs QP for linear MPC anyway?
Conventional MPC uses quadratic programming (QP) to minimise, on-line, a cost over n linearly constrained control moves. However, stability constraints often require the use of la...
Basil Kouvaritakis, Mark Cannon, J. Anthony Rossit...
SERA
2005
Springer
14 years 2 months ago
Generating UML Models from Domain Patterns
The development of a family of applications in a domain can be greatly eased if patterns in the domain are systematically reused. Systematic use of such a pattern can be achieved ...
Dae-Kyoo Kim, Jon Whittle
CAV
2007
Springer
212views Hardware» more  CAV 2007»
14 years 1 months ago
A Tutorial on Satisfiability Modulo Theories
Abstract. Solvers for satisfiability modulo theories (SMT) check the satisfiability of first-order formulas containing operations from various theories such as the Booleans, bit-ve...
Leonardo Mendonça de Moura, Bruno Dutertre,...
FTCS
1998
114views more  FTCS 1998»
13 years 10 months ago
Verification of a Safety-Critical Railway Interlocking System with Real-Time Constraints
Ensuring the correctness of computer systems used in lifecritical applications is very difficult. The most commonly used verification methods, simulation and testing, are not exha...
Vicky Hartonas-Garmhausen, Sérgio Vale Agui...
FASE
2010
Springer
14 years 13 days ago
Efficient Runtime Assertion Checking of Assignable Clauses with Datagroups
Runtime assertion checking is useful for debugging programs and specifications. Existing tools check invariants as well as method preand postconditions, but mostly ignore assignabl...
Hermann Lehner, Peter Müller