Verifying finite-state properties of large-scale programs
Designers of software components can use finite-state properties to denote behavioral interface specifications which enforce client-side programming rules that state how the components ought to be used. This allows users of these components to check their client code for compliance with these rules,...
Main Author: | Bodden, Eric |
---|---|
Other Authors: | Laurie Hendren (Internal/Supervisor) |
Format: | Others |
Language: | en |
Published: |
McGill University
2010
|
Subjects: | |
Online Access: | http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=86909 |
Similar Items
-
Infeasibility of solving finite mathematical problems
by: Brown, Adam
Published: (2010) -
Towards 3D structure prediction of large RNA molecules: an integer programming framework to insert local 3D motifs in secondary structure
by: Reinharz, Vladimir
Published: (2013) -
Optimal time scales for reinforcement learning behaviour strategies
by: Comanici, Gheorghe
Published: (2010) -
Dynamic purity analysis for Java programs
by: Xu, HaiYing
Published: (2007) -
Cache aware load balancing for scaling of multi-tier architectures
by: Tickoo, Neeraj
Published: (2011)