Improved Resolution-Based Method for Satisfiability Checking Formulas of the Language L

Author(s):  
Anatoly Chebotarev ◽  
Sergey Krivoi
1964 ◽  
Vol 31 (2) ◽  
pp. 190-191
Author(s):  
Virgil Hinshaw,
Keyword(s):  

Author(s):  
Poul F. Williams ◽  
Henrik R. Andersen ◽  
Henrik Hulgaard

Author(s):  
Peter Niebert ◽  
Moez Mahfoudh ◽  
Eugene Asarin ◽  
Marius Bozga ◽  
Oded Maler ◽  
...  

2018 ◽  
Vol 6 (1) ◽  
Author(s):  
Adenilso S. Simao ◽  
Auri M. R. Vincenzi ◽  
Antonio C. L. Santana ◽  
Jose C. Maldonado

Instrumentation is a technique frequently used in software engineering for several different purposes, e.g. program and/or specification execution trace, testing criteria coverage analy- sis, and reverse engineering. Instrumenting a software product can be divided into two main tasks: (i) deriving the software product structure and (ii) inserting statements for collecting runtime/simulation information. Most instrumentation approaches are specific to a given domain or language. Thus, it is very difficult to reuse the effort expended in developing an instrumenter, even if the target languages are quite similar. To tackle this problem, in this paper, we propose an instrumentation-oriented meta-language, named IDeL, designed to support the description of both main tasks of instru- mentation process, namely: (i) the product structure derivation and (ii) the insertion of the instrumentation statements. In order to apply IDeL to a specific language L, it should be in- stantiated with a context-free grammar of L. To promote IDeL’s practical use, we also developed a supporting tool, named idelgen, that can be thought of as an application generator, based on the transformational programming paradigm and tailored to the instrumentation process. We illustrate the main concepts of our proposal with examples describing the instrumentation required in some traditional data flow testing criteria for C language.


2000 ◽  
Vol 10 (02) ◽  
pp. 209-216
Author(s):  
JUHA HONKALA

A language L is called thin if there exists an integer n0such that for all n≥n0L contains at most one word of length n. We show that thinness is decidable for exponential D0L languages. We show also that Siegel's result concerning integral points on algebraic curves of positive genus can often be used to prove that a polynomially bounded HD0L language is thin.


2009 ◽  
Vol 22 (2) ◽  
pp. 117-119
Author(s):  
Matti Järvisalo

Sign in / Sign up

Export Citation Format

Share Document