Sciweavers

262 search results - page 19 / 53
» Verifying Web Applications Using Bounded Model Checking
Sort
View
80
Voted
KBSE
2007
IEEE
15 years 6 months ago
Sequential circuits for program analysis
A number of researchers have proposed the use of Boolean satisfiability solvers for verifying C programs. They encode correctness checks as Boolean formulas using finitization: ...
Fadi A. Zaraket, Adnan Aziz, Sarfraz Khurshid
95
Voted
ASWEC
2010
IEEE
14 years 12 months ago
Non-Monotonic Model Completion in Web Application Engineering
—Formal models are often used to verify systems and prove their correctness, and ensure that transformed models remain consistent to the original system. However, formal techniqu...
Jevon M. Wright, Jens Dietrich
ICWE
2005
Springer
15 years 5 months ago
Modelling the Behaviour of Web Applications with ArgoUWE
A methodology needs to be empowered by appropriate tool support. The CASE tool ArgoUWE supports designers in the use of the UWE methodology for the systematic, UML-based developmen...
Alexander Knapp, Nora Koch, Gefei Zhang
ICRA
2010
IEEE
194views Robotics» more  ICRA 2010»
14 years 10 months ago
Continuous collision detection for non-rigid contact computations using local advancement
Abstract— We present a novel algorithm to perform continuous collision detection(CCD) between non-rigid, deformable models using local advancement. Given the initial and final c...
Min Tang, Young J. Kim, Dinesh Manocha
88
Voted
FMICS
2008
Springer
15 years 1 months ago
Efficient Symbolic Model Checking for Process Algebras
Different approaches have been developed to mitigate the state space explosion of model checking techniques. Among them, symbolic verification techniques use efficient representati...
José Vander Meulen, Charles Pecheur