Amanote Research
Register
Sign In
Analyzing Test Completeness for Dynamic Languages
doi 10.1145/2931037.2931059
Full Text
Open PDF
Abstract
Available in
full text
Date
January 1, 2016
Authors
Christoffer Quist Adamsen
Gianluca Mezzetti
Anders Møller
Publisher
ACM Press
Related search
Fuzzy Database Query Languages and Their Relational Completeness Theorem
IEEE Transactions on Knowledge and Data Engineering
Computational Theory
Computer Science Applications
Information Systems
Mathematics
Automatically Generating Environments for Dynamic Diagram Languages
Dynamic Programming Strategies for Analyzing Biomolecular Sequences
Lecture Notes Series, Institute for Mathematical Sciences
Mathematics
Analyzing of Dynamic Characteristics for Discrete S-PCNN
Typing Dynamic Languages: A Review
Turing Test as a Defining Feature of AI-Completeness
Studies in Computational Intelligence
Artificial Intelligence
Agile Engineering of Internal Domain-Specific Languages With Dynamic Programming Languages
Developing Adaptable Components Using Dynamic Languages
Boundary Integral Equations for Analyzing Dynamic Problemsof 3-D Porouselasticity
Problems of Strength and Plasticity
