Filters








3,665 Hits in 3.1 sec

Ultimate Automizer with Unsatisfiable Cores [chapter]

Matthias Heizmann, Jürgen Christ, Daniel Dietsch, Jochen Hoenicke, Markus Lindenmann, Betim Musa, Christian Schilling, Stefan Wissert, Andreas Podelski
2014 Lecture Notes in Computer Science  
Ultimate Automizer is an automatic software verification tool for C programs. This tool is a prototype implementation of an automata-theoretic approach that allows a modular verification of programs.  ...  Furthermore, this is the first implementation of a novel interpolation technique where interpolants are not obtained from an interpolating theorem prover but from a combination of a live variable analysis  ...  Demonstration Category Termination We also participated in the demonstration category on termination with Ultimate Büchi Automizer which is our tool for termination analysis.  ... 
doi:10.1007/978-3-642-54862-8_35 fatcat:xeifdkwgqnhtbllpfgvec4tvre

Competition Report: CHC-COMP-20

Philipp Rümmer
2020 Electronic Proceedings in Theoretical Computer Science  
In this year, 9 solvers participated at the competition, and were evaluated in four separate tracks on problems in linear integer arithmetic, linear real arithmetic, and arrays.  ...  This report gives an overview of the competition design, explains the organisation of the competition, and presents the competition results.  ...  Such benchmarks include problems generated by the Ultimate tools in the LIA-lin-arrays track.  ... 
doi:10.4204/eptcs.320.15 fatcat:iirqvwhg4fdbrkle3y3wa5upla

Competition Report: CHC-COMP-21

Grigory Fedyukovich, Philipp Rümmer
2021 Electronic Proceedings in Theoretical Computer Science  
In this year, 7 solvers participated at the competition, and were evaluated in 7 separate tracks on problems in linear integer arithmetic, linear real arithmetic, arrays, and algebraic data-types.  ...  This report gives an overview of the competition design, explains the organisation of the competition, and presents the competition results.  ...  LIA-nonlin LIA-lin LIA-nl- arrays LIA-lin- arrays LRA-TS LRA-TS- par ADT- nonlin Winner Spacer Spacer Spacer Spacer Spacer Spacer Spacer Place 2 Ultimate Unihorn Golem Ultimate Unihorn  ... 
doi:10.4204/eptcs.344.7 fatcat:k2xxu6scfza2hc4fw6qi6nadq4

2009 MEMOCODE Co-Design Contest

Forrest Brewer, James C. Hoe
2009 2009 7th IEEE/ACM International Conference on Formal Methods and Models for Co-Design  
The goal of the contest is to invite developers of tools and platforms to showcase their technology in a leveled competition and to encourage hands-on design activities in the fields of interest of the  ...  The values associated with the grid points are stored in a two-dimensional array CART.  ...  Region P is also evenly spanned by an NxN grid, and the values associated with the grid points are stored in a twodimensional array POL.  ... 
doi:10.1109/memcod.2009.5185379 dblp:conf/memocode/BrewerH09 fatcat:j3rnydwudfh4vctq5ehwghiztu

Programmable bio-nanochip technology for the diagnosis of cardiovascular disease at the point-of-care

Nicolaos Christodoulides, Floriano N Pierre, Ximena Sanchez, Luanyi Li, Kyle Hocquard, Aaron Patton, Rachna Muldoon, Craig S Miller, Jeffrey L Ebersole, Spencer Redding, Chih-Ko Yeh, Wieslaw B Furmaga (+4 others)
2012 Methodist DeBakey Cardiovascular Journal  
This article reviews the programmable bio-nanochip (P-BNC) system, a new medical microdevice approach with the capacity to deliver both high performance and reduced cost.  ...  Interpolation of the signal intensities of these images into the dose curve, as derived from dedicated automated data analysis macros, allows for the determination and ultimate reporting of cTnI levels  ...  Interpolation of the signal intensities of these images into the dose curve, as derived from dedicated automated data analysis macros, allows for the determination and ultimate reporting of cTnI levels  ... 
pmid:22891104 pmcid:PMC3405784 fatcat:jr2vdlyajndq7n6vpaug7ygg6a

Encoding Floating-Point Numbers Using the SMT Theory in ESBMC: An Empirical Evaluation over the SV-COMP Benchmarks [chapter]

Mikhail Y. R. Gadelha, Lucas C. Cordeiro, Denis A. Nicole
2017 Lecture Notes in Computer Science  
particular, we exploit the availability of two different SMT solvers (MathSAT and Z3) to discharge and check the verification conditions produced by our encoding using the benchmarks from the International Competition  ...  [14] describe Ceagle, an automated verification tool for C programs.  ...  sin interpolated index true-unreach-call.c, sin interpolated bigrange loose true-unreach-call.c and sin interpolated bigrange tight true-unreach-call.c  ... 
doi:10.1007/978-3-319-70848-5_7 fatcat:t2defnoaeravteynwclsjgmdyy

An Entropy-Maximization Approach to Automated Training Set Generation for Interatomic Potentials [article]

Mariia Karabin, Danny Perez
2020 arXiv   pre-print
We show that this approach generates much more diverse training sets than unbiased sampling and is competitive with hand-crafted training sets.  ...  We formalize these requirements in a local entropy maximization framework and propose an automated sampling scheme to sample from this objective function.  ...  These results suggest that the automated training set should be competitive with the handcrafted set as it contains a more diverse distribution of atomic environments.  ... 
arXiv:2002.07876v1 fatcat:5cjy5xnmpnhmjnepnorzv72fjq

Some recent advances in automated analysis

Erika Ábrahám, Klaus Havelund
2015 International Journal on Software Tools for Technology Transfer (STTT)  
Due to the increasing complexity of software systems, there is a growing need for automated and scalable software synthesis and analysis.  ...  We are grateful to all authors for their contributions and to the reviewers of TACAS'14 and of this special issue for their thorough and valuable work.  ...  In 2014, the SAT competition had an impressive number of 79 participants with 137 solvers. The SATLive!  ... 
doi:10.1007/s10009-015-0403-0 fatcat:hwu7b64kh5brrlm7spzyucxibe

Design and implementation of a parallel unstructured Euler solver using software primitives

R. Das, D. J. Mavriplis, J. Saltz, S. Gupta, R. Ponnysamy
1994 AIAA Journal  
The overall solution efficiency is compared with that obtained on the CRAY-YMP vector supercomputer.  ...  The goal is to minimize solution time by achieving high computational rates with a numerically efficient algorithm.  ...  The multigrid interpolation procedures, in which the addresses and weights for interpolation have been precomputed, can be viewed as a simple gather/scatter of data from one array (grid) to another.  ... 
doi:10.2514/3.12012 fatcat:ra2dv3yc7rgkzel54y4k6lokfy

Quasi-liquid crystals of electrons and positrons

Gianluigi Zangari
2020 Zenodo  
This evidence is in contrast with the "rigid bunch" model (J. Schwinger 1945).  ...  The study was conducted with the SHT unconventional statistical category calculus system, developed and patented by the present author for the analysis of complex systems.  ...  Ultimately, to have a significant CSR contribution, we must have: ⇢ g ( ) > 1 N 1 ⇠ 1 N < 0 As an example, in our case, we evaluate the form factor for Gaussian bunches.  ... 
doi:10.5281/zenodo.3987313 fatcat:6b7uvhfn3rg5lfnbz62kfnojdm

Quasi-liquid crystals of electrons and positrons

Gianluigi Zangari
2020 Zenodo  
This evidence is in contrast with the "rigid bunch" model (J. Schwinger 1945).  ...  The study was conducted with the SHT unconventional statistical category calculus system, developed and patented by the present author for the analysis of complex systems.  ...  Ultimately, to have a significant CSR contribution, we must have: ⇢ g ( ) > 1 N 1 ⇠ 1 N < 0 As an example, in our case, we evaluate the form factor for Gaussian bunches.  ... 
doi:10.5281/zenodo.4421561 fatcat:76nrvt36fvhsrnxbvixyswbqdm

Shaping Nanoelectrodes for High-Precision Dielectrophoretic Assembly of Carbon Nanotubes

Didi Xu, A. Subramanian, Lixin Dong, B.J. Nelson
2009 IEEE transactions on nanotechnology  
Both simulation and experimental results show that the geometries of two opposing electrodes significantly affect the precision and robustness with which CNTs can be deposited.  ...  and unstable DEP forces; otherwise, unequally distributed electric fields and DEP forces induce a significant number of assembly failures in the array.  ...  Therefore, the approach is well suited for the integration with nanoelectronic devices, such as crossbar memories, switches, logic gates [10] , [11] and, ultimately, nanocircuits and nanonetworks [  ... 
doi:10.1109/tnano.2009.2015295 fatcat:cugpfkmbljd57glsaggz72chxm

Efficient Strategies for CEGAR-Based Model Checking

Ákos Hajdu, Zoltán Micskei
2019 Journal of automated reasoning  
We implement our new contributions in the Theta framework allowing us to compare them with state-of-the-art algorithms.  ...  Automated formal verification is often based on the Counterexample-Guided Abstraction Refinement (CEGAR) approach.  ...  Ultimate Automizer [45] also works with a portfolio of refiners, including Craig interpolation, unsatisfiable cores, various SMT solvers and different ways to abstract a trace.  ... 
doi:10.1007/s10817-019-09535-x fatcat:pab76on3wfhu7jz34etj45bbfu

The PREP pipeline: standardized preprocessing for large-scale EEG analysis

Nima Bigdely-Shamlo, Tim Mullen, Christian Kothe, Kyung-Min Su, Kay A. Robbins
2015 Frontiers in Neuroinformatics  
By its nature, such data is large and complex, making automated processing essential.  ...  We introduce a multi-stage robust referencing scheme to deal with the noisy channel-reference interaction.  ...  Ultimately, the preprocessing pipeline interpolated four channels of this dataset during robust referencing.  ... 
doi:10.3389/fninf.2015.00016 pmid:26150785 pmcid:PMC4471356 fatcat:qz3wsi26kvf7vm6p2r36yooaju

Software Verification with PDR: Implementation and Empirical Evaluation of the State of the Art [article]

Dirk Beyer, Matthias Dangl
2020 arXiv   pre-print
k-induction, and (2) performed an experimental study on the largest publicly available benchmark set of C verification tasks, in which we explore the effectiveness and efficiency of software verification with  ...  We contribute a replicable and thorough comparative evaluation of the state of the art: We (1) implemented a standalone PDR algorithm and, as improvement, a PDR-based auxiliary-invariant generator for  ...  Those verifiers are, in alphabetical order, Skink, Ultimate Automizer, Ultimate Kojak, Ultimate Taipan, VeriAbs, and VIAP.  ... 
arXiv:1908.06271v2 fatcat:gt4z3tohnrdzteimgsbd2bwxuy
« Previous Showing results 1 — 15 out of 3,665 results