Sciweavers

566 search results - page 96 / 114
» Array Abstractions from Proofs
Sort
View
SAS
2004
Springer
123views Formal Methods» more  SAS 2004»
14 years 27 days ago
Non-termination Inference for Constraint Logic Programs
Termination has been a subject of intensive research in the logic programming community for the last two decades. Most works deal with proving universal left termination of a given...
Étienne Payet, Frédéric Mesna...
COMPSAC
2002
IEEE
14 years 15 days ago
A Toolset for Supporting UML Static and Dynamic Model Checking
The Unified Modeling Language has become widely accepted as a standard in software development. Several tools have been produced to support UML model validation. However, most of...
Wuwei Shen, Kevin J. Compton, James Huggins
ICCHP
2010
Springer
14 years 10 days ago
A Mobile Phone Application Enabling Visually Impaired Users to Find and Read Product Barcodes
Abstract. While there are many barcode readers available for identifying products in a supermarket or at home on mobile phones (e.g., Red Laser iPhone app), such readers are inacce...
Ender Tekin, James M. Coughlan
CDC
2009
IEEE
127views Control Systems» more  CDC 2009»
14 years 8 days ago
A time-periodic Lyapunov approach for motion planning of controllable driftless systems on SU(n)
Abstract— For a right-invariant and controllable driftless system on SU(n), we consider a time-periodic reference trajectory along which the linearized control system generates s...
Hector Bessa Silveira, Paulo Sérgio Pereira...
EUROCRYPT
1999
Springer
13 years 11 months ago
Proving in Zero-Knowledge that a Number Is the Product of Two Safe Primes
Abstract. We present the first efficient statistical zero-knowledge protocols to prove statements such as: – A committed number is a prime. – A committed (or revealed) number ...
Jan Camenisch, Markus Michels