News authentication and tampered images: evaluating the photo-truth impact through image verification algorithms

In this paper we discuss efficient symbolic representations for infinite-state systems specified using linear arithmetic constraints. We give algorithms for constructing finite automata which represent integer sets that satisfy linear constraints. These automata can represent either signed or unsigned integers and have a lower number of states compared to other similar approaches. We present efficient storage techniques for the transition function of the automata and extend the construction algorithms to formulas on both boolean and integer variables. We also derive conditions which guarantee that the pre-condition computations used in symbolic verification algorithms do not cause an exponential increase in the automata size. We experimentally compare different symbolic representations by using them to verify non-trivial concurrent systems. Experimental results show that the symbolic representations based on our construction algorithms outperform the polyhedral representation used in Omega Library, and the automata representation used in LASH.

Download Full-text

MODELING AND VERIFYING COMPOSITE DYNAMIC EVOLUTION OF SOFTWARE ARCHITECTURES USING HYPERGRAPH GRAMMARS

International Journal of Software Engineering and Knowledge Engineering ◽

10.1142/s0218194013500204 ◽

2013 ◽

Vol 23 (06) ◽

pp. 775-799 ◽

Cited By ~ 4

Author(s):

HONGZHEN XU ◽

GUOSUN ZENG

Keyword(s):

Data Structures ◽

Formal Method ◽

Graphical Representation ◽

General Structure ◽

Software Systems ◽

Dynamic Evolution ◽

Software Architectures ◽

Model Composite ◽

Verification Algorithms ◽

Data Structures And Algorithms

As software systems become more and more complex, there is need to consider not only data structures and algorithms but also the general structure or architecture of the system. Many researchers have presently focused on dynamic evolution of software architectures. Most of them usually emphasized on describing and analyzing the dynamic evolution process of software architectures, while lacking formally modeling and verifying composite dynamic evolution of software architectures. In this paper, we propose a formal method of modeling and verifying composite dynamic evolution of software architectures using hypergraph grammars. We represent software architectures with hypergraphs, give out corresponding composite evolution rules of software architectures, and then model composite dynamic evolution of software architectures according to those rules. At last we verify the liveness property of composite dynamic evolution of software architectures using model checking, and give out corresponding verification algorithms. Our approach provides a graphical representation for composite dynamic evolution of software architectures, and displays a formal theoretical basis on grammars.

Download Full-text

A framework for improving the performance of verification algorithms with a low false positive rate requirement and limited training data

IEEE International Joint Conference on Biometrics ◽

10.1109/btas.2014.6996275 ◽

2014 ◽

Cited By ~ 1

Author(s):

Ognjen Arandelovic

Keyword(s):

False Positive ◽

False Positive Rate ◽

Training Data ◽

Verification Algorithms ◽

Positive Rate ◽

Rate Requirement

Download Full-text

Survey of the current voter verification algorithms

2008 International Conference on Computer and Communication Engineering ◽

10.1109/iccce.2008.4580639 ◽

2008 ◽

Author(s):

Majid Javid Moayed ◽

Abdul Azim Abdul Ghani ◽

Ramlan Mahmod

Keyword(s):

Verification Algorithms

Download Full-text

Extended BDD's: trading off canonicity for structure in verification algorithms

1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers ◽

10.1109/iccad.1991.185305 ◽

2002 ◽

Cited By ~ 22

Author(s):

S.-W. Jeong ◽

B. Plessier ◽

G. Hachtel ◽

F. Somenzi

Keyword(s):

Verification Algorithms

Download Full-text

Transforming Undecidable Synthesis Problems into Decidable Problems

10.29007/tj84 ◽

2018 ◽

Author(s):

Bernd Finkbeiner

Keyword(s):

Distributed Systems ◽

Formal Specification ◽

Synthesis Problem ◽

Specific System ◽

System Architectures ◽

Development Stages ◽

Verification Algorithms ◽

Local Specifications ◽

Full Design ◽

Uniform Treatment

Synthesis holds the promise to revolutionize the development ofcomplex systems by automating the translation from specifications toimplementations. Synthesis algorithms are based on the same level ofmathematical rigor as verification algorithms but can be applied atearlier development stages, when only parts of the design areavailable. Given a formal specification of the desired systemproperties, for example in a temporal logic, we determine if thepartial design can be completed into a full design that satisfies theproperties.For general distributed systems, the synthesis problem is undecidable.However, there has been a sequence of discoveries where thedecidability was established for specific system architectures, suchas pipelines and rings, or other restrictions on the problem, such aslocal specifications. Encouraged by these findings, new specificationlanguages like Coordination Logic aim for a uniform treatment of thesynthesis problem.In this talk, I will review several techniques that transformundecidable synthesis problems into decidable problems.

Download Full-text

Iris Based Human Verification Algorithms

Biometric Authentication - Lecture Notes in Computer Science ◽

10.1007/978-3-540-25948-0_63 ◽

2004 ◽

pp. 458-466 ◽

Cited By ~ 3

Author(s):

Bhola Ram Meena ◽

Mayank Vatsa ◽

Richa Singh ◽

Phalguni Gupta

Keyword(s):

Verification Algorithms

Download Full-text