Filters








214,447 Hits in 4.6 sec

Theorem Proving Support for View Consistency Checking

Richard F Paige, Jonathan S Ostroff, Phillip J Brooke
2003 L objet  
An example of how the PVS theorem prover might be used to verify view consistency is described. RÉSUMÉ.  ...  A formal, mechanically checked specification of the consistency constraints between two views of object-oriented systems are presented.  ...  The constraints will also be specified in the PVS specification language [OWR 01], so that theorem proving technology can be exploited both in checking the consistency of views, and in validating the specifications  ... 
doi:10.3166/objet.9.4.115-134 fatcat:zyppmhyevjggzioaraucwe6xzu

Mechanisms for controlling evolution in persistent object systems

R Morrison, RCH Connor, QI Cutts, GNC Kirby, D Stemple
1993 Microprocessors and microsystems  
The following theorem is the kind that needs to be proved to show that a transaction T leaves a database in a consistent state if it was consistent before the transaction.  ...  Employing a theorem prover allows more powerful static checking but it may not be possible to prove all the theorems.  ... 
doi:10.1016/0141-9331(93)90047-b fatcat:utjsb2qpszc3novr7y3ymtup6q

Challenges in Formal Methods for Testing and Verification of Cloud Computing Systems

Amjad Gawanme, Ahmad Alomari
2015 Scalable Computing : Practice and Experience  
For instance, several scheduling algorithms are being used for cloud frameworks, such as Hadoop for instance, that are found to suffer from scheduling failures.  ...  In this paper, we discuss the state of the art on using formal methods for the verification of cloud computing systems.  ...  based on model checking and theorem proving.  ... 
doi:10.12694/scpe.v16i3.1104 fatcat:3paeyn7khzfh5jtadfnxdfiyla

Pragmatic equivalence and safety checking in Cryptol

Levent Erkök, John Matthews
2008 Proceedings of the 3rd workshop on Programming languages meets program verification - PLPV '09  
We are also thankful to Magnus Carlsson, Lee Pike, John Launchbury, Joe Hurd, and Sally Browning for their feedback and comments on this work.  ...  This unified view provides a consistent and familiar environment for end-users, avoiding the need for an extra language to express properties.  ...  Some important Cryptol theorems can not be proved in a reasonable amount of time (i.e. sev-eral days) using the currently available automated proving tools.  ... 
doi:10.1145/1481848.1481860 dblp:conf/plpv/ErkokM09 fatcat:icktgbj275gongmmsxxrn6oqoe

Formal Verification of Consistency between Feature Model and Software Architecture in Software Product Line

Tonny Kurniadi Satyananda, Danhyung Lee, Sungwon Kang
2007 International Conference on Software Engineering Advances (ICSEA 2007)  
In this paper, we present a formal approach to verification of consistency between feature model and component and connector view of software architecture.  ...  Consistency among these artifacts should be verified to ensure error-free product.  ...  Consistency theorems for one-to-many mapping cover consistency theorems for one-to-one mapping.  ... 
doi:10.1109/icsea.2007.33 dblp:conf/icsea/SatyanandaLK07 fatcat:eazgjlajznbhjeqcswuue6fi64

Electronic Geometry Textbook: A Geometric Textbook Knowledge Management System [article]

Xiaoyu Chen
2010 arXiv   pre-print
By integrating an external geometric theorem prover and an external dynamic geometry software package, the system offers the facilities for automatically proving theorems and generating dynamic figures  ...  An interface has been developed for users to create geometry textbooks with automatic checking, in real time, of the consistency of the structure of each resulting textbook.  ...  It has been supported by the Chinese National Key Basic Research (973) Project 2005CB321901/2 and the SKLSDE Open Fund BUAA-SKLSDE-09KF-01.  ... 
arXiv:1005.0080v1 fatcat:3odyuvxtcvfarbj4kfpoqjizjq

A theorem prover for a computational logic [chapter]

Robert S. Boyer, J Strother Moore
1990 Lecture Notes in Computer Science  
We briefly review a mechanical theorem-prover for a logic of recursive functions over finitely generated objects including the integers, ordered pairs, and symbols.  ...  Conclusions Proof Checking as a Mere Engineering Challenge In our view it seems humanly feasible to write mechanical proof checkers for any part of mathematics and to check mechanically any result in  ...  Instead of supporting ''Boyer-Moore logic'', which reflects an odd mixture of functions vaguely, but not consistently, related to Lisp 1.5 and Interlisp, ACL2 directly supports perfectly and accurately  ... 
doi:10.1007/3-540-52885-7_75 fatcat:kxfrkpou4rautfbn7oixw6rpgi

Towards lean proof checking [chapter]

G. Barthe, H. Elbers
1996 Lecture Notes in Computer Science  
theorem proving.  ...  In our view, the main novelty of our approach is to combine a sound theoretical foundation with an e cient implementation.  ...  Decidability of type-checking follows easily. Consistency is proved by extending the realizability model of 20].  ... 
doi:10.1007/3-540-61697-7_5 fatcat:uouivor7kndd7kqk7rb6veyiyq

Consistent Integration of Formal Methods [chapter]

Peter Braun, Heiko Lötzbeyer, Bernhard Schätz, Oscar Slotosch
2000 Lecture Notes in Computer Science  
The usability of formal concepts for system design depends essentially on their integration in the design process.  ...  Further work is needed in requirements phase, to support methods for requirements tracing (as found in the DOORS tool).  ...  Furthermore, in the modeling phase the use of graphical support for model based development steps (refinement, splitting of transitions, combining channels, etc.) in AutoFocus must be investigated.  ... 
doi:10.1007/3-540-46419-0_5 fatcat:yuwzuojf6zc5hil5li3k7n3aqy

Frameworks Based on Templates for Rigorous Model-driven Development

Nuno Amálio, Fiona Polack, Susan Stepney
2007 Electronical Notes in Theoretical Computer Science  
This allows the construction of catalogues of patterns (represented as templates) and meta-theorems for frameworks.  ...  On the one hand, semi-formal modelling approaches that are used in practical, large-scale system development, such as the UML, are not amenable to formal analysis and consistency checking.  ...  Acknowledgement This work was funded by the Portuguese Foundation for Science and Technology, grant 6904/2001. Some of the work presented here was supervised by Prof.  ... 
doi:10.1016/j.entcs.2007.09.002 fatcat:xtij4yr5ivex7bnu7nibvavzku

Page 3645 of Mathematical Reviews Vol. , Issue 95f [page]

1995 Mathematical Reviews  
The first part consists of seven theorems to be proved with resolution, while the second part proposes ten theo- rems for equality reasoning.  ...  The close relations among propositional theorem proving methods and integer programming have been thoroughly investigated by R. 95f:68218 G. Jeroslow [Logic-based decision support, Ann.  ... 

Engineering Mathematical Knowledge [chapter]

Achim Mahnke, Jan Scheffczyk
2006 Lecture Notes in Computer Science  
Consistency checking roughly corresponds to model checking.  ...  In this paper, we combine the projects MMiSS 3 and CDET. 4 That way, we achieve major benefits for mathematical knowledge management: (1) Semantic annotations relate mathematical constructs.  ...  Therefore, our approach cannot be used for theorem proving. Instead, we can use theorem provers in order to check semantic relations on embedded mathematical objects.  ... 
doi:10.1007/11618027_17 fatcat:cj2apveytjae5ee2vufrvtzina

The PROSPER toolkit

Louise A. Dennis, Graham Collins, Michael Norrish, Richard J. Boulton, Konrad Slind, Thomas F. Melham
2003 International Journal on Software Tools for Technology Transfer (STTT)  
proving can be embedded in an application but also in the benefits gained from the combination of theorem proving and decision procedures) and the development of generic proof support for integrated verification  ...  The second part consists of a datatype for the results of remote function calls and support for installing and calling procedures in an API.  ... 
doi:10.1007/s100090200076 fatcat:bc4pffbyuzda5ejbxtdsrvp4y4

Query-based data pricing

Paraschos Koutris, Prasang Upadhyaya, Magdalena Balazinska, Bill Howe, Dan Suciu
2012 Proceedings of the 31st symposium on Principles of Database Systems - PODS '12  
However, current mechanisms for pricing data are very simple: buyers can choose only from a set of explicit views, each with a specific price.  ...  In this paper, we propose a framework for pricing data on the Internet that, given the price of a few views, allows the price of any query to be derived automatically.  ...  This work is supported in part by the NSF and Microsoft through NSF grant CCF-1047815 and also grant IIS-0915054.  ... 
doi:10.1145/2213556.2213582 dblp:conf/pods/KoutrisUBHS12 fatcat:ketdik6kbrhhzbvqdmirpyfdne

Query-Based Data Pricing

Paraschos Koutris, Prasang Upadhyaya, Magdalena Balazinska, Bill Howe, Dan Suciu
2015 Journal of the ACM  
However, current mechanisms for pricing data are very simple: buyers can choose only from a set of explicit views, each with a specific price.  ...  In this paper, we propose a framework for pricing data on the Internet that, given the price of a few views, allows the price of any query to be derived automatically.  ...  This work is supported in part by the NSF and Microsoft through NSF grant CCF-1047815 and also grant IIS-0915054.  ... 
doi:10.1145/2770870 fatcat:uv476hrxgnbujmjdx6qoj2xwe4
« Previous Showing results 1 — 15 out of 214,447 results