Sciweavers

911 search results - page 62 / 183
» Combining programs and state machines
Sort
View
ERSHOV
2009
Springer
14 years 3 months ago
Symbolic Bounded Conformance Checking of Model Programs
Abstract. Model programs are high-level behavioral specifications typically representing Abstract State Machines or ASMs. Conformance checking of model programs is the problem of ...
Margus Veanes, Nikolaj Bjørner
ICTAC
2009
Springer
14 years 3 months ago
Input-Output Model Programs
Abstract. Model programs are used as high-level behavioral specifications typically representing abstract state machines. For modeling reactive systems, one uses input-output mode...
Margus Veanes, Nikolaj Bjørner
GECCO
2003
Springer
128views Optimization» more  GECCO 2003»
14 years 1 months ago
Learning Biped Locomotion from First Principles on a Simulated Humanoid Robot Using Linear Genetic Programming
We describe the first instance of an approach for control programming of humanoid robots, based on evolution as the main adaptation mechanism. In an attempt to overcome some of th...
Krister Wolff, Peter Nordin
CONCUR
2006
Springer
14 years 14 days ago
Minimization, Learning, and Conformance Testing of Boolean Programs
Boolean programs with recursion are convenient abstractions of sequential imperative programs, and can be represented as recursive state machines (RSMs) or pushdown automata. Motiv...
Viraj Kumar, P. Madhusudan, Mahesh Viswanathan
POPL
2007
ACM
14 years 9 months ago
Logic-flow analysis of higher-order programs
This work presents a framework for fusing flow analysis and theorem proving called logic-flow analysis (LFA). The framework itthe reduced product of two abstract interpretations: ...
Matthew Might