172 search results - page 12 / 35 » Reducing Behavioural to Structural Properties of Programs wi... |
IADIS
2004
13 years 9 months ago
2004
Two sets of multimedia learning materials were compared for their ability to promote learning of introductory computer programming The first set of materials was a sequentially na...
CODES
2002
IEEE
14 years 15 days ago
2002
IEEE
This paper describes the formal verification of the recently introduced Dual Transition Petri Net (DTPN) models [12], using model checking techniques. The methodology presented a...
CORR
2004
Springer
13 years 7 months ago
2004
Springer
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...
ICFP
2009
ACM
14 years 8 months ago
2009
ACM
We present a new approach for constructing and verifying higherorder, imperative programs using the Coq proof assistant. We build on the past work on the Ynot system, which is bas...
CONCUR
2010
Springer
13 years 7 months ago
2010
Springer
ompositionality of Round Abstraction Abstract Dan R. Ghica and Mohamed N. Menaa University of Birmingham, U.K. We revisit a technique called round abstraction as a solution to the ...