Computer and information sciences topic list of research papers
-
Recursion Engineering for Reduction Incorporated Parsers
Abstract Reduction Incorporated (RI) recognisers and parsers deliver high performance by suppressing the stack activity except for those rules that generate fully embedded recursion. Automaton constructions for RI parsing have been presented by...
2005 / Adrian Johnstone, Elizabeth Scott -
SMT-AI: an Abstract Interpreter as Oracle for k-induction
Abstract The last decade has seen a major development of verification techniques based on SMT solvers used to prove inductive invariants on systems. This approach allows to prove functional properties and scale up to handle industrial problems....
2010 / Pierre Roux, Rémi Delmas, Pierre-Loïc Garoche -
Closure of Tree Automata Languages under Innermost Rewriting
Abstract Preservation of regularity by a term rewriting system (TRS) states that the set of reachable terms from a tree automata (TA) language (aka regular term set) is also a TA language. It is an important and useful property, and there have been...
2009 / Adrià Gascón, Guillem Godoy, Florent Jacquemard -
On the Relationship Between Web Services Security and Traditional Protocols
Abstract XML and Web Services security specifications define elements to incorporate security tokens within a SOAP message. We propose a method for mapping such messages to an abstract syntax in the style of Dolev-Yao, and in particular Casper...
2006 / E. Kleiner, A.W. Roscoe -
State of the Practice in Algorithmic Debugging
Abstract Algorithmic debugging is a semi-automatic debugging technique which is based on the answers of an oracle (usually the programmer) to a series of questions generated automatically by the algorithmic debugger. The technique typically...
2009 / Diego Cheda, Josep Silva -
Formal Modelling of PKI Based Authentication
Abstract One of the main aims of certificate based Public Key Infrastructure (PKI) is to provide authentication in distributed systems. Through its functions, PKI authentication can be viewed as a re-usable component that can be integrated with...
2009 / Ali Nasrat Haidar, Ali E. Abdallah -
Formal Sequentialization of Distributed Systems via Program Rewriting
Abstract Formal sequentialization is introduced as a rewriting process for the reduction of parallelism and internal communication statements of distributed imperative programs. It constructs an equivalence proof in an implicit way, via the...
2007 / Miquel Bertran, Francesc Babot, August Climent -
Type-Based Security for Mobile Computing Integrity, Secrecy and Liveness
Abstract This paper sketches an idea on how to challenge the three security issues concentrating on code mobility, by the development of a general theory of types of the π-calculus and the higher-order π-calculus; and how to apply it for designing...
2006 / Nobuko Yoshida -
Agile Modelling of Cellular Signalling (Invited Paper)
Abstract We illustrate with a simple example how using a rule-based approach to the modelling of protein interaction networks allows for quickly putting together models (ease of expression), and quickly modifying them (ease of variation). ...
2009 / Vincent Danos -
Using CLP Simplifications to Improve Java Bytecode Termination Analysis
Abstract In an earlier work, a termination analyzer for Java bytecode was developed that translates a Java bytecode program into a constraint logic program and then proves the termination of the latter. An efficiency bottleneck of the termination...
2009 / Fausto Spoto, Lunjin Lu, Fred Mesnard -
A True-Concurrent Interpretation of Behavioural Scenarios
Abstract We describe a translation of scenarios given in UML 2.0 sequence diagrams into a tuples-based behavioural model that considers multiple access points for a participating instance and exhibits true-concurrency. This is important in a...
2009 / Sotiris Moschoyiannis, Paul Krause, Michael W. Shields -
The Case for Analog Circuit Verification
Abstract The traditional approach to validate analog circuits is to utilize extensive SPICE-level simulations. The main challenge of this approach is knowing when all important corner cases have been simulated. A new alternative is to utilize formal ...
2006 / Chris J. Myers, Reid R. Harrison, David Walter, Nicholas Seegmiller, Scott Little -
A Lightweight Approach to Customizable Composition Operators for Java-like Classes
Abstract We propose a formal framework for extending a class-based language, equipped with a given class composition mechanism, to allow programmers to define their own derived composition operators. These definitions can exploit the full expressive ...
2010 / Giovanni Lagorio, Marco Servetto, Elena Zucca -
To be or not to be …lazy (In a Parallel Context)
Abstract Laziness restricts the exploitation of parallelism because expressions are evaluated only on demand. Thus, parallel extensions of lazy functional languages, like Haskell, usually override laziness to some extent. The purpose of the present...
2009 / Mercedes Hidalgo-Herrero, Yolanda Ortega-Mallén -
WCET Analysis of Data Dependent, Component Oriented, Embedded Software Systems
Abstract Component oriented software construction approaches have gained enormous attention in recent years. A developer has to consider functional and non-functional requirements of a customer or a market segment. For real-time systems...
2009 / Peter Szulman -
Variance Based Offline Power Disturbance Signal Classification Using Support Vector Machine and Random Kitchen Sink
Abstract In this paper, five classes of different power quality disturbances such as swell, sag, harmonics, sag with harmonics and swell with harmonics are synthesized using MATLAB/SIMULINK software which is further decomposed into 8 intrinsic mode...
2015 / Aneesh C., Hisham P.M., Sachin Kumar S., Maya P., K.P. Soman -
Loop Redundant of Industrial Ethernet Applied to Airport
Abstract This paper describes the technical characteristics of Loop redundant of industrial ethernet, further details the scheme execution planning of Loop redundant of industrial ethernet and the overall schedule relation between ring network...
2012 / Yangfan -
Bayesian Estimation of the Intensity for Independent Cluster Point Processes: An analytic solution
Abstract This paper presents an approach for estimating clusters of points from a sequence of data with false alarms. The cluster process is characterised by a hierarchical point process, where each member of the cluster is conditioned on a parent...
2011 / Anthony Swain, Daniel Clark -
Real Time Implementation and Performance Evaluation of WCDMA System over AWGN Channel on TMS320C6713DSK
Abstract Wideband Code Division Multiple Access (WCDMA) technology has emerged as the most widely adopted air interface technology for third generation Universal Mobile Telecommunication System (UMTS) network architecture. This paper presents a real ...
2012 / H.N. Latha, M.V. Palachandra, Madhusudhan Rao -
Stabilization of a Fire Truck Robot by an Invariant Manifold Theory
Abstract There exist various studies on underactuated control methods so far, but most of them are confined into the case of systems with two inputs, and therefore there are a few studies for systems with three or more inputs. In this paper, a fire...
2012 / Keigo Watanabe, Yuka Ueda, Isaku Nagai, Shoichi Maeyama