Sciweavers

949 search results - page 55 / 190
» Lightweight Formal Methods for Computer Algebra Systems
Sort
View
SPLC
2008
15 years 3 months ago
Calculating and Modeling Common Parts of Software Product Lines
This paper builds on product line CCS (PL-CCS), an algebraic approach to modeling the behavior of software product lines. The semantics of PL-CCS specifications is given in terms ...
Alexander Gruler, Martin Leucker, Kathrin D. Schei...
ISSAC
2007
Springer
146views Mathematics» more  ISSAC 2007»
15 years 8 months ago
Fast and exact geometric analysis of real algebraic plane curves
An algorithm is presented for the geometric analysis of an algebraic curve f(x, y) = 0 in the real affine plane. It computes a cylindrical algebraic decomposition (CAD) of the pla...
Arno Eigenwillig, Michael Kerber, Nicola Wolpert
ACNS
2011
Springer
231views Cryptology» more  ACNS 2011»
14 years 6 months ago
Cold Boot Key Recovery by Solving Polynomial Systems with Noise
A method for extracting cryptographic key material from DRAM used in modern computers has been recently proposed in [9]; the technique was called Cold Boot attacks. When considerin...
Martin Albrecht, Carlos Cid
COMMA
2006
15 years 3 months ago
Computing Preferred Extensions for Argumentation Systems with Sets of Attacking Arguments
The hitherto most abstract, and hence general, argumentation system, is the one described by Dung in a paper from 1995. This framework does not allow for joint attacks on arguments...
Søren Holbech Nielsen, Simon Parsons
105
Voted
SIAMJO
2008
93views more  SIAMJO 2008»
15 years 2 months ago
Recursive Trust-Region Methods for Multiscale Nonlinear Optimization
A class of trust-region methods is presented for solving unconstrained nonlinear and possibly nonconvex discretized optimization problems, like those arising in systems governed by...
Serge Gratton, Annick Sartenaer, Philippe L. Toint