Filters








8,927 Hits in 4.2 sec

Block Abstraction Memoization for CPAchecker [chapter]

Daniel Wonisch
2012 Lecture Notes in Computer Science  
Block Abstraction Memoization (ABM) is a technique in software model checking that exploits the modularity of programs during verification by caching.  ...  To this end, ABM records the results of block analyses and reuses them if possible when revisiting the same block again.  ...  We would like to thank Philipp Wendler for his extensive help with the integration of ABM into CPAchecker.  ... 
doi:10.1007/978-3-642-28756-5_41 fatcat:lyezm2zrlfamfdah6kitsztx64

Not all patterns, but enough

Neil Mitchell, Colin Runciman
2008 Proceedings of the first ACM SIGPLAN symposium on Haskell - Haskell '08  
The analysis is defined for a core first-order language to which Haskell 98 programs are reduced.  ...  Our analysis tool has been successfully applied to a range of programs, and our techniques seem to scale well.  ...  So, for example: ":" ({[ ] } β) = false ":" ({(:) α} β) = 0`Sat`α ∧ 1`Sat`(β β) Example 3 (revisited) Safe evaluation of (head xs) requires xs to be non-empty.  ... 
doi:10.1145/1411286.1411293 dblp:conf/haskell/MitchellR08 fatcat:x6sm5wzzorhbbjlua3eo2wfwhi

Not all patterns, but enough

Neil Mitchell, Colin Runciman
2009 SIGPLAN notices  
The analysis is defined for a core first-order language to which Haskell 98 programs are reduced.  ...  Our analysis tool has been successfully applied to a range of programs, and our techniques seem to scale well.  ...  So, for example: ":" ({[ ] } β) = false ":" ({(:) α} β) = 0`Sat`α ∧ 1`Sat`(β β) Example 3 (revisited) Safe evaluation of (head xs) requires xs to be non-empty.  ... 
doi:10.1145/1543134.1411293 fatcat:2meaw7rv3rcarj6fkxwdwvza7y

System Descriptions of the First International Competition on Computational Models of Argumentation (ICCMA'15) [article]

Matthias Thimm, Serena Villata
2015 arXiv   pre-print
of computational approaches to abstract argumentation problems.  ...  This volume contains the system description of the 18 solvers submitted to the First International Competition on Computational Models of Argumentation (ICCMA'15) and therefore gives an overview on state-of-the-art  ...  .: Complexity-Sensitive Decision Procedures for Abstract Argumentation. Artif. Intell. 206, 53–78 (2014) 3. Eén, N., Sörensson, N.: An extensible SAT-solver. In: Proc. SAT 2003.  ... 
arXiv:1510.05373v1 fatcat:ll33crzcwfenll4v7yf4xae7ya

Model Finding for Recursive Functions in SMT [chapter]

Andrew Reynolds, Jasmin Christian Blanchette, Simon Cruanes, Cesare Tinelli
2016 Lecture Notes in Computer Science  
SMT solvers have recently been extended with techniques for finding models in presence of universally quantified formulas in some restricted fragments.  ...  techniques are applicable.  ...  We would also like to thank Damien Busato-Gaston and Emmanouil Koukoutos for providing the initial set of benchmarks used in the evaluation, and the anonymous reviewers for their suggestions and comments  ... 
doi:10.1007/978-3-319-40229-1_10 fatcat:onkr4y3uvjdozgu2abravox65a

Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors

Miroslav N Velev, Randal E Bryant
2003 Journal of symbolic computation  
We identify one SAT-checker that significantly outperforms the rest. We evaluate ways to enhance its performance by variations in the generation of the Boolean correctness formulas.  ...  We compare SAT-checkers and decision diagrams on the evaluation of Boolean formulas produced in the formal verification of both correct and buggy versions of superscalar and VLIW microprocessors.  ...  Moskewicz for providing us with Chaff and for fine-tuning it on our benchmarks.  ... 
doi:10.1016/s0747-7171(02)00091-3 fatcat:ma4sxaghq5cdreaqjmcubhws7e

Detection of Conflicting Compliance Rules

Francois Hantry, Mohand-Said Hacid, Romuald Thion
2011 2011 IEEE 15th International Enterprise Distributed Object Computing Conference Workshops  
We extend classical boolean conflict driven solver to provide a new temporal conflict driven solver for temporal logic.  ...  This problem is of paramount importance to achieve automatic support for early declarative design and to support evolution of rules in contract-based or service-based systems.  ...  Only a few techniques (e.g., [32] ) try to avoid revisiting states as using induction for safety and Craig interpolant (e.g., [33] ).  ... 
doi:10.1109/edocw.2011.57 dblp:conf/edoc/HantryHT11 fatcat:dmvjksvxyvgbxc6tllx25dukdu

Model-Based Testing for Verification Back-Ends [chapter]

Cyrille Artho, Armin Biere, Martina Seidl
2013 Lecture Notes in Computer Science  
We applied this approach to our SAT solver Lingeling and compared it to existing testing approaches, revealing the effectiveness of MBT for the development of reliable SAT solvers.  ...  Therefore, effective testing techniques have to be employed.  ...  Later it was confirmed by John Hughes, through private communication, that techniques for fuzzing parameters of implementations have been used extensively in applications of QuickCheck [15] too.  ... 
doi:10.1007/978-3-642-38916-0_3 fatcat:eplytqoaongjtdkbwury32g6gm

Proofs by Deduction [chapter]

2017 Logic and Language Models for Computer Science  
Bjørner, Jasmin Christian Blanchette, Viorica Sofronie-Stokkermans, and Christoph Weidenbach Models and proofs are the quintessence of logical analysis and argumentation.  ...  Models and proofs even play an integral role within deductive tools as major methods for efficient proof search rely on refining a simultaneous search for a model or a proof.  ...  References Using Information from Deduction for Complexity Analysis SAT-based techniques for parameter synthesis and optimization A key challenge in this context is the estimation of the parameter  ... 
doi:10.1142/9789813229211_0003 fatcat:cqpgqtobz5gx3db5bq54gxrd4m

The Influence of Hotel Attributes on Brand Attachment and Post-Consumption Outcomes: The Mediating Effects of Brand Credibility

Nadzirah Rosli, Norbani Che-Ha, Ezlika Mohd Ghazali
2021 International Journal of Business and Society  
The result offers implications for hotelier and direction for future research.  ...  ., satisfaction, revisit intention and word-of-mouth). Partial Least Squares Structural Equation Modelling (PLS-SEM) approach was deployed to validate the research model.  ...  Using a bootstrapping technique with resampling of 5000, the path estimates and t-statistics were calculated for the hypothesized relationships.  ... 
doi:10.33736/ijbs.3255.2020 fatcat:2ihfrdt74rgvvgqn5dexc3orhu

OOST: An Object Oriented Tool for Satellite Orbit Design

Salem A.A, Zaki M., Wahdan A.A
2005 American Journal of Applied Sciences  
A Data Mining technique is applied to the satellite data. The technique as such relies upon the Decision Tree.  ...  The simulation module of OOST has been used to provide orbit design and satellite simulation for all geocentric orbits using an interactive world map that is synchronized with simulation time.  ...  These characters are an abstraction of the underlying variables (for example: "e_Node" means eccentricity object class, "Ω_Node" means an argument of perigee object class, "a_Node" means semi major axis  ... 
doi:10.3844/ajassp.2005.806.818 fatcat:igl3ur5oazg6tavc4al5jwpjbu

Computer Science and Metaphysics: A Cross-Fertilization [article]

Daniel Kirchner, Christoph Benzmüller, Edward N. Zalta
2019 arXiv   pre-print
Computational philosophy is the use of mechanized computational techniques to unearth philosophical insights that are either difficult or impossible to find using traditional philosophical methods.  ...  was computer assisted, and (b) conclude that these results work not only to the obvious benefit of philosophy but also, less obviously, to the benefit of computer science, since the new computational techniques  ...  In Section 2, we explain how the SSE technique led to insights about Gödel's ontological argument.  ... 
arXiv:1905.00787v3 fatcat:slgk2xqljva7jdgapn6nzkaile

Proceedings of the First International Workshop on Argumentation in Logic Programming and Non-Monotonic Reasoning (Arg-LPNMR 2016) [article]

Sarah Alice Gaggl, Juan Carlos Nieves, Hannes Strass
2016 arXiv   pre-print
This volume contains the papers presented at Arg-LPNMR 2016: First International Workshop on Argumentation in Logic Programming and Nonmonotonic Reasoning held on July 8-10, 2016 in New York City, NY.  ...  structure of a specific AF reasoning problem, the SAT/MaxSAT encoding, and the search techniques and heuristics applying within the solvers.  ...  A game- theoretic measure of argument strength for abstract ar- gumentation.  ... 
arXiv:1611.02439v1 fatcat:sjsiat3jyjf5bpkjjivvf5szim

BLITZ: Compositional bounded model checking for real-world programs

Chia Yuan Cho, Vijay D'Silva, Dawn Song
2013 2013 28th IEEE/ACM International Conference on Automated Software Engineering (ASE)  
Bounded Model Checking (BMC) for software is a precise bug-finding technique that builds upon the efficiency of modern SAT and SMT solvers.  ...  A novel feature of our technique is to decompose the behaviour of a program into a sequence of BMC instances and use a combination of satisfying assignments and unsatisfiability proofs to propagate information  ...  ACKNOWLEDGMENTS We thank the anonymous reviewers for their valuable feedback.  ... 
doi:10.1109/ase.2013.6693074 dblp:conf/kbse/ChoDS13 fatcat:3khhxlz3nffzbmuaaaycj6iige

Page 553 of Mathematical Reviews Vol. , Issue 2003A [page]

2003 Mathematical Reviews  
Lower bounds on certain separation widths of complete b-ary trees of height / are derived with a new technique. For these trees previous techniques yield poor bounds.  ...  Using network flow arguments, it is shown that for a graph with N nodes, a (1/3)-edge-separator can be found which is within the factor O(log” N) of optimal.  ... 
« Previous Showing results 1 — 15 out of 8,927 results