36,096 Hits in 4.1 sec

Grey-Box Checking [chapter]

Edith Elkind, Blaise Genest, Doron Peled, Hongyang Qu
2006 Lecture Notes in Computer Science  
A possible method is to analyze the system while learning the model (black box checking).  ...  However, learning may be an expensive task, thus it needs to be guided, e.g., using the checked property or an inaccurate model (adaptive model checking).  ...  Intuitively, we want W to accept words that consist of n blocks of |Σ|/2 letters from Σ separated by x's, followed by a y; within each block, the letters should be ordered according to ≺.  ... 
doi:10.1007/11888116_30 fatcat:2gdhhdic3vfmpejzpvtu7fgd2a

Model Checking Based Approach for Compliance Checking

Fabio Martinelli, Francesco Mercaldo, Vittoria Nardone, Albina Orlando, Antonella Santone, Gigliola Vaglini
2019 Information Technology and Control  
Our aim is to use a model checking based approach to verify compliance.  ...  The discovered process model has to be analyzed to verify it respects the defined properties, i.e., the so-called compliance checking.  ...  This leads to more time required to fix the problem in the source code.  ... 
doi:10.5755/j01.itc.48.2.21724 fatcat:ghapmaazlzegli3tum62t7whfa


Roberto Micalizio
2012 Computational intelligence  
This paper addresses the problem of recovering from action failures caused by a specific class of plan threats: faults in the functionalities of the agent.  ...  These deviations are typically considered as action failures.  ...  The pseudo-code of the conformant planner is given in Figure 7 .  ... 
doi:10.1111/j.1467-8640.2012.00444.x fatcat:62fzuleynvdc7c4n767nx2empq

Approximation of action theories and its application to conformant planning

Phan Huy Tu, Tran Cao Son, Michael Gelfond, A. Ricardo Morales
2011 Artificial Intelligence  
in T lp (D) from an initial partial state δ 0 to a partial state satisfying the goal δ f corresponds to a conformant plan for δ 0 and δ f in T (D).  ...  , and a path in T lp (D) from an initial partial state δ 0 to a partial state satisfying δ f corresponds to a conformant plan for δ 0 and δ f in T (D).  ...  This paper can be viewed as an attempt to apply some of these ideas to the narrow (but hopefully sufficiently important) topic of conformant planning. 17 The first two authors would like to acknowledge  ... 
doi:10.1016/j.artint.2010.04.007 fatcat:4lzuxekhh5gztjslm7gftxkify

Combining type-checking with model-checking for system verification

Zhiqiang Ren, Hongwei Xi
2016 2016 ACM/IEEE International Conference on Formal Methods and Models for System Design (MEMOCODE)  
Naturally, McErlang allows access to the program states and actions between states.  ...  The code is shown in Figure 4·6 . While certain ATS syntax may look unfamiliar and shall be explained below, the code should intuitively not be difficult to follow.  ... 
doi:10.1109/memcod.2016.7797745 dblp:conf/memocode/RenX16 fatcat:2hjce2siibgtnct2ddl7xvydke

Progress Checking for Dummies [chapter]

Antti Valmari, Henri Hansen
2018 Lecture Notes in Computer Science  
We make a simple modification to a well-known model to demonstrate that it passes progress verification although the resulting model is intuitively badly incorrect.  ...  Our ideas are especially well-suited for newcomers in model checking, and work well with stubborn set methods.  ...  Checking it from the state space is technically simpler than that of LTL X .  ... 
doi:10.1007/978-3-030-00244-2_8 fatcat:7ahsunwrkjdjvg2qxurytyfyku

Runtime Refinement Checking of Concurrent Data Structures

Serdar Tasiran, Shaz Qadeer
2005 Electronical Notes in Theoretical Computer Science  
In the second phase, a verification thread runs concurrently with the implementation and uses the logged information to check that the execution conforms to the high-level specification.  ...  We present a runtime technique for checking that a concurrent implementation of a data structure conforms to a high-level executable specification with atomic operations.  ...  Runtime checking of conformance to a state invariant derived from an object model has been investigated [4] .  ... 
doi:10.1016/j.entcs.2004.01.028 fatcat:wwimli4yqvdsredchiabgzi45u

Conformance checking of service behavior

Wil M. P. van der Aalst, Marlon Dumas, Chun Ouyang, Anne Rozinat, Eric Verbeek
2008 ACM Transactions on Internet Technology  
Recently, languages such as BPEL and CDL have been proposed to describe the way services can interact from a behavioral perspective.  ...  Conformance checking is the act of verifying whether one or more parties stick to the agreed-upon behavior by observing the actual behavior, e.g., the exchange of messages between all parties.  ...  However, before introducing the notion of conformance checking and the mapping from BPEL to Petri nets, we consider choreography conformance checking in a broader perspective.  ... 
doi:10.1145/1361186.1361189 fatcat:uuxjvuqoqzhedlmxt34jxh4o44

Symbolic Bounded Conformance Checking of Model Programs [chapter]

Margus Veanes, Nikolaj Bjørner
2010 Lecture Notes in Computer Science  
We introduce the Bounded Conformance Checking problem or BCC as a special case of the conformance checking problem when the length of traces is bounded and provide a mapping of BCC to a theorem proving  ...  Conformance checking of model programs is the problem of deciding if the set of traces allowed by one model program forms a subset of the set of traces allowed by another model program.  ...  We often say action to also mean an action rule or an action symbol, if the intent is clear from the context.  ... 
doi:10.1007/978-3-642-11486-1_33 fatcat:obaogogixfhkjhld4cywbcdzde

Model Checking MANETs with Arbitrary Mobility [chapter]

Fatemeh Ghassemi, Saeide Ahmadi, Wan Fokkink, Ali Movaghar
2013 Lecture Notes in Computer Science  
The temporal operators, from Action Computation Tree Logic with an unless operator, are parameterized by multi-hop constraints over topologies, to express conditions on successful scenarios of a MANET  ...  To model check MANET protocol with respect to the underlying topology and connectivity changes, we here introduce a branching-time temporal logic interpreted over CLTSs.  ...  The pseudo code of the model checking algorithm's backbone is given in Fig. 3 .  ... 
doi:10.1007/978-3-642-40213-5_14 fatcat:dxzpljcsiff5pmdtcm44ognrcm

Model Checking Normative Agent Organisations [chapter]

Louise Dennis, Nick Tinnemeier, John-Jules Meyer
2010 Lecture Notes in Computer Science  
We show that different properties may be checked depending on the information available to the model checker about the internal state of the agents.  ...  We demonstrate how this framework can be used to check properties of the organisation and of the individual agents in an LTL based property specification language.  ...  These semantics are very similar to those used for processing counts-as rules and sanction rules and, in many cases the implementation uses the same code, simply customised to choose from different sets  ... 
doi:10.1007/978-3-642-16867-3_4 fatcat:utxrc2hktrd7nk425h7sab5qbq

Model Checking Agent Communication [chapter]

J. Bentahar, J.-J. Ch. Meyer, W. Wan
2010 Specification and Verification of Multi-agent Systems  
This logic, called ACTL*, extends CTL* by allowing formulae to constrain actions as well as states. The verification method uses an on-the-fly efficient algorithm.  ...  We use a variant of Extended Computation Tree Logic CTL* for specifying these dialogue games and the properties to be checked.  ...  Acknowledgement We would like to thank the reviewers for their valuable comments and suggestions.  ... 
doi:10.1007/978-1-4419-6984-2_3 fatcat:v3rh32bkrbd7jgygycajb6ds5m

OrionPlanning: Improving modularization and checking consistency on software architecture

Gustavo Santos, Nicolas Anquetil, Anne Etien, Stephane Ducasse, Marco Tulio Valente
2015 2015 IEEE 3rd Working Conference on Software Visualization (VISSOFT)  
Many techniques have been proposed in the literature to support architecture definition, conformance, and analysis. However, there is a lack of adoption of such techniques by the industry.  ...  In this paper, we present ORIONPLANNING, a prototype tool to assist refactorings at large scale. The tool provides support for modelbased refactoring operations.  ...  Future work include modifications to the usability of the tool. For example, we would like to make some actions more intuitive by using drag-and-drop instead of menus.  ... 
doi:10.1109/vissoft.2015.7332435 dblp:conf/vissoft/SantosAEDV15 fatcat:zu5ebgfvgrgddfbjqgwlzcncde

Model Checking Commitment Protocols [chapter]

Mohamed El-Menshawy, Jamal Bentahar, Rachida Dssouli
2011 Lecture Notes in Computer Science  
We present a new logic-based language to specify commitment protocols, which is derived from extending CTL * with modalities for social commitments and associated actions.  ...  We investigate the problem of verifying commitment protocols that are widely used to regulate interactions among cognitive agents by means of model checking.  ...  The authors would like to thank Natural Sciences and Engineering Research Council of Canada (NSERC) and Fond Québecois de la recherche sur la société et la culture (FQRSC) for their financial support.  ... 
doi:10.1007/978-3-642-21827-9_5 fatcat:72rpq2lazzhthnijt3fs55x27u

Symbolic model checking [chapter]

E. Clarke, K. McMillan, S. Campos, V. Hartonas-Garmhausen
1996 Lecture Notes in Computer Science  
That is, H(s, t) is true if and only if there is a path from s to t labeled by a sequence of zero or more r actions.  ...  A number of different methods have been proposed: temporal logic model checking, language containment algorithms for automata, "conformation checking" in trace theory, and testing for various equivalences  ... 
doi:10.1007/3-540-61474-5_93 fatcat:luz3iefbijeepg2q5cmhflefee
« Previous Showing results 1 — 15 out of 36,096 results