100 search results - page 4 / 20 » Invariant inference for static checking |
SIGMOD
1989
ACM
14 years 1 months ago
1989
ACM
Machiavelli is a polymorphically typed programming language in the spirit of ML, but supports an extended method of type inferencing that makes its polymorphism more general and a...
AI
1998
Springer
14 years 2 months ago
1998
Springer
Abstract. Dynamic Bayesian networks (DBNs) extend Bayesian networks from static domains to dynamic domains. The only known generic method for exact inference in DBNs is based on dy...
POPL
1999
ACM
14 years 2 months ago
1999
ACM
A promising technique for protecting privacy and integrity of sensitive data is to statically check information flow within programs that manipulate the data. While previous work...
SAS
2007
Springer
14 years 3 months ago
2007
Springer
Interval analysis seeks static lower and upper bounds on the values of program variables. These bounds are useful, especially for inferring invariants to prove buffer overflow ch...
ICECCS
2007
IEEE
14 years 4 months ago
2007
IEEE
Identifying and resolving design problems in the early design phase can help ensure software quality and save costs. There are currently few tools for analyzing designs expressed ...