1796 search results - page 218 / 360 » An Approach to Compositional Model Checking |
ISSTA
2004
ACM
14 years 1 months ago
2004
ACM
Model checking based on validating temporal logic formulas has proven practical and effective for numerous software engineering applications. As systems based on this approach ha...
TSMC
2010
13 years 3 months ago
2010
Abstract--It is critical to use automated generators for synthetic models and data, given the sparsity of benchmark models for empirical analysis and the cost of generating models ...
AOSD
2004
ACM
14 years 1 months ago
2004
ACM
A widespread implementation approach for the join point mechanism of aspect-oriented languages is to instrument areas in code that match the static part of pointcut designators, i...
ICIW
2007
IEEE
14 years 4 days ago
2007
IEEE
Abstract-- Maintaining large websites and verifying their semantic content is a difficult task. In this paper we propose a framework for syntactic validation, semantic verification...
COLING
1992
13 years 9 months ago
1992
The main problem arising from the use of complex constraints in Computational Linguists is due to the NP-hardness of checking whether a given set of constraints is satisfiable and...