1242 search results - page 72 / 249 » The Theory of Grammar Constraints |
165
click to vote
SEFM
2006
IEEE
16 years 5 days ago
2006
IEEE
The key to many approaches to reason about pointerbased data structures is the availability of a decision procedure to automatically discharge proof obligations in a theory encomp...
142
click to vote
CSE
2009
IEEE
15 years 9 months ago
2009
IEEE
—Context, the pieces of information that capture the characteristics of ubiquitous computing environment, is often imprecise and incomplete due to user mobility, unreliable wirel...
178
click to vote
NORDSEC
2009
Springer
16 years 22 days ago
2009
Springer
Runtime enforcement is a common mechanism for ensuring that program executions adhere to constraints specified by a security policy. It is based on two simple ideas: the enforceme...
165
click to vote
JUCS
2008
15 years 6 months ago
2008
: Reasoning about incomplete qualitative temporal information is an essential topic in many artificial intelligence and natural language processing applications. In the domain of n...
222
click to vote
FROCOS
2011
Springer
14 years 5 months ago
2011
Springer
A dominant approach to Satisfiability Modulo Theories (SMT) relies on the integration of a Conflict-Driven-Clause-Learning (CDCL) SAT solver and of a decision procedure able to h...